./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/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 b77251edba7469485878084a6afedecceec13cb1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:54:18,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:54:18,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:54:18,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:54:18,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:54:18,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:54:18,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:54:18,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:54:18,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:54:18,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:54:18,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:54:18,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:54:18,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:54:18,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:54:18,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:54:18,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:54:18,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:54:18,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:54:18,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:54:18,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:54:18,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:54:18,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:54:18,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:54:18,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:54:18,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:54:18,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:54:18,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:54:18,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:54:18,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:54:18,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:54:18,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:54:18,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:54:18,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:54:18,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:54:18,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:54:18,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:54:18,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:54:18,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:54:18,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:54:18,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:54:18,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:54:18,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:54:18,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:54:18,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:54:18,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:54:18,073 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:54:18,073 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:54:18,073 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:54:18,074 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:54:18,074 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:54:18,074 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:54:18,074 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:54:18,074 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:54:18,075 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:54:18,075 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:54:18,075 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:54:18,075 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:54:18,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:54:18,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:54:18,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:54:18,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:54:18,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:54:18,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:54:18,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:54:18,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:54:18,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:54:18,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:54:18,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:54:18,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:54:18,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:54:18,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:54:18,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:54:18,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:54:18,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:54:18,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:54:18,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:54:18,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:54:18,080 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:54:18,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:54:18,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:54:18,081 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:54:18,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:54:18,081 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_2e3554ea-5159-4983-8b75-2d4888feef2f/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 -> b77251edba7469485878084a6afedecceec13cb1 [2019-12-07 16:54:18,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:54:18,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:54:18,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:54:18,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:54:18,217 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:54:18,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i [2019-12-07 16:54:18,255 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/data/4a19a12b2/0f94fa4c5d6c430f8277c29513528671/FLAG00b44d444 [2019-12-07 16:54:18,771 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:54:18,771 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/sv-benchmarks/c/pthread-wmm/mix010_power.oepc.i [2019-12-07 16:54:18,781 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/data/4a19a12b2/0f94fa4c5d6c430f8277c29513528671/FLAG00b44d444 [2019-12-07 16:54:19,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/data/4a19a12b2/0f94fa4c5d6c430f8277c29513528671 [2019-12-07 16:54:19,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:54:19,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:54:19,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:54:19,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:54:19,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:54:19,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19, skipping insertion in model container [2019-12-07 16:54:19,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:54:19,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:54:19,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:54:19,588 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:54:19,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:54:19,676 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:54:19,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19 WrapperNode [2019-12-07 16:54:19,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:54:19,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:54:19,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:54:19,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:54:19,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:54:19,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:54:19,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:54:19,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:54:19,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... [2019-12-07 16:54:19,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:54:19,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:54:19,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:54:19,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:54:19,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:54:19,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:54:19,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:54:19,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:54:19,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:54:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:54:19,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:54:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:54:19,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:54:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:54:19,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:54:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:54:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:54:19,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:54:19,783 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 16:54:20,145 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:54:20,145 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:54:20,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:54:20 BoogieIcfgContainer [2019-12-07 16:54:20,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:54:20,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:54:20,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:54:20,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:54:20,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:54:19" (1/3) ... [2019-12-07 16:54:20,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea22c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:54:20, skipping insertion in model container [2019-12-07 16:54:20,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:54:19" (2/3) ... [2019-12-07 16:54:20,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea22c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:54:20, skipping insertion in model container [2019-12-07 16:54:20,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:54:20" (3/3) ... [2019-12-07 16:54:20,151 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-07 16:54:20,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:54:20,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:54:20,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:54:20,163 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:54:20,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:54:20,222 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:54:20,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:54:20,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:54:20,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:54:20,235 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:54:20,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:54:20,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:54:20,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:54:20,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:54:20,246 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-07 16:54:20,247 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-07 16:54:20,303 INFO L134 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-07 16:54:20,303 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:54:20,313 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 690 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 16:54:20,330 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-07 16:54:20,363 INFO L134 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-07 16:54:20,364 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:54:20,369 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 690 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 16:54:20,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 16:54:20,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:54:23,069 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 16:54:23,380 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 16:54:23,486 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-07 16:54:23,486 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 16:54:23,489 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-07 16:54:41,356 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-07 16:54:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-07 16:54:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:54:41,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:41,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:54:41,363 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 16:54:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-07 16:54:41,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:54:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566101620] [2019-12-07 16:54:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:54:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:41,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566101620] [2019-12-07 16:54:41,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:41,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:54:41,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965884235] [2019-12-07 16:54:41,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:54:41,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:54:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:54:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:41,530 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-07 16:54:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:42,424 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-07 16:54:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:54:42,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 16:54:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:42,906 INFO L225 Difference]: With dead ends: 125226 [2019-12-07 16:54:42,906 INFO L226 Difference]: Without dead ends: 117946 [2019-12-07 16:54:42,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-07 16:54:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-07 16:54:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-07 16:54:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-07 16:54:51,905 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-07 16:54:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:51,905 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-07 16:54:51,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:54:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-07 16:54:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:54:51,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:51,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:51,910 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 16:54:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-07 16:54:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:54:51,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860238459] [2019-12-07 16:54:51,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:54:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:51,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860238459] [2019-12-07 16:54:51,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:51,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:54:51,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709063513] [2019-12-07 16:54:51,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:54:51,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:54:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:54:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:54:51,972 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-07 16:54:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:53,003 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-07 16:54:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:54:53,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:54:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:53,572 INFO L225 Difference]: With dead ends: 183040 [2019-12-07 16:54:53,572 INFO L226 Difference]: Without dead ends: 182991 [2019-12-07 16:54:53,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:55:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-07 16:55:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-07 16:55:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-07 16:55:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-07 16:55:05,325 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-07 16:55:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:05,326 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-07 16:55:05,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:55:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-07 16:55:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:55:05,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:05,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:55:05,331 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 16:55:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-07 16:55:05,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:05,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307973846] [2019-12-07 16:55:05,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:05,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307973846] [2019-12-07 16:55:05,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:05,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:55:05,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097561503] [2019-12-07 16:55:05,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:55:05,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:55:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:55:05,388 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 4 states. [2019-12-07 16:55:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:06,650 INFO L93 Difference]: Finished difference Result 237004 states and 961776 transitions. [2019-12-07 16:55:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:55:06,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:55:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:07,298 INFO L225 Difference]: With dead ends: 237004 [2019-12-07 16:55:07,298 INFO L226 Difference]: Without dead ends: 236948 [2019-12-07 16:55:07,299 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 16:55:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236948 states. [2019-12-07 16:55:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236948 to 201086. [2019-12-07 16:55:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201086 states. [2019-12-07 16:55:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201086 states to 201086 states and 829537 transitions. [2019-12-07 16:55:21,209 INFO L78 Accepts]: Start accepts. Automaton has 201086 states and 829537 transitions. Word has length 13 [2019-12-07 16:55:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:21,210 INFO L462 AbstractCegarLoop]: Abstraction has 201086 states and 829537 transitions. [2019-12-07 16:55:21,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:55:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 201086 states and 829537 transitions. [2019-12-07 16:55:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:55:21,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:21,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:55:21,220 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 16:55:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-07 16:55:21,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:21,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242130218] [2019-12-07 16:55:21,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:21,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242130218] [2019-12-07 16:55:21,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:21,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:55:21,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210942602] [2019-12-07 16:55:21,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:55:21,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:55:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:55:21,282 INFO L87 Difference]: Start difference. First operand 201086 states and 829537 transitions. Second operand 5 states. [2019-12-07 16:55:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:22,760 INFO L93 Difference]: Finished difference Result 275142 states and 1124357 transitions. [2019-12-07 16:55:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:55:22,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:55:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:23,489 INFO L225 Difference]: With dead ends: 275142 [2019-12-07 16:55:23,489 INFO L226 Difference]: Without dead ends: 275142 [2019-12-07 16:55:23,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:55:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275142 states. [2019-12-07 16:55:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275142 to 230321. [2019-12-07 16:55:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230321 states. [2019-12-07 16:55:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230321 states to 230321 states and 948783 transitions. [2019-12-07 16:55:38,641 INFO L78 Accepts]: Start accepts. Automaton has 230321 states and 948783 transitions. Word has length 16 [2019-12-07 16:55:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:38,641 INFO L462 AbstractCegarLoop]: Abstraction has 230321 states and 948783 transitions. [2019-12-07 16:55:38,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:55:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 230321 states and 948783 transitions. [2019-12-07 16:55:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:55:38,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:38,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:55:38,655 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 16:55:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1933654436, now seen corresponding path program 1 times [2019-12-07 16:55:38,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:38,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170106296] [2019-12-07 16:55:38,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:38,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170106296] [2019-12-07 16:55:38,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:38,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:55:38,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100891542] [2019-12-07 16:55:38,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:55:38,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:55:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:55:38,694 INFO L87 Difference]: Start difference. First operand 230321 states and 948783 transitions. Second operand 3 states. [2019-12-07 16:55:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:40,148 INFO L93 Difference]: Finished difference Result 217163 states and 885294 transitions. [2019-12-07 16:55:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:55:40,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:55:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:40,724 INFO L225 Difference]: With dead ends: 217163 [2019-12-07 16:55:40,724 INFO L226 Difference]: Without dead ends: 217163 [2019-12-07 16:55:40,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:55:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217163 states. [2019-12-07 16:55:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217163 to 214125. [2019-12-07 16:55:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214125 states. [2019-12-07 16:55:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214125 states to 214125 states and 874034 transitions. [2019-12-07 16:55:51,193 INFO L78 Accepts]: Start accepts. Automaton has 214125 states and 874034 transitions. Word has length 18 [2019-12-07 16:55:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:51,194 INFO L462 AbstractCegarLoop]: Abstraction has 214125 states and 874034 transitions. [2019-12-07 16:55:51,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:55:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 214125 states and 874034 transitions. [2019-12-07 16:55:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:55:51,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:51,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:55:51,206 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 16:55:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1771299396, now seen corresponding path program 1 times [2019-12-07 16:55:51,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:51,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756567068] [2019-12-07 16:55:51,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:51,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756567068] [2019-12-07 16:55:51,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:51,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:55:51,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553984205] [2019-12-07 16:55:51,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:55:51,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:55:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:55:51,238 INFO L87 Difference]: Start difference. First operand 214125 states and 874034 transitions. Second operand 3 states. [2019-12-07 16:55:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:51,360 INFO L93 Difference]: Finished difference Result 38715 states and 124641 transitions. [2019-12-07 16:55:51,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:55:51,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:55:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:51,417 INFO L225 Difference]: With dead ends: 38715 [2019-12-07 16:55:51,417 INFO L226 Difference]: Without dead ends: 38715 [2019-12-07 16:55:51,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:55:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38715 states. [2019-12-07 16:55:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38715 to 38715. [2019-12-07 16:55:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38715 states. [2019-12-07 16:55:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38715 states to 38715 states and 124641 transitions. [2019-12-07 16:55:52,460 INFO L78 Accepts]: Start accepts. Automaton has 38715 states and 124641 transitions. Word has length 18 [2019-12-07 16:55:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:52,460 INFO L462 AbstractCegarLoop]: Abstraction has 38715 states and 124641 transitions. [2019-12-07 16:55:52,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:55:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 38715 states and 124641 transitions. [2019-12-07 16:55:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:55:52,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:52,466 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 16:55:52,466 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 16:55:52,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-07 16:55:52,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:52,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749675291] [2019-12-07 16:55:52,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:52,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749675291] [2019-12-07 16:55:52,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:52,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:55:52,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906035047] [2019-12-07 16:55:52,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:55:52,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:55:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:55:52,523 INFO L87 Difference]: Start difference. First operand 38715 states and 124641 transitions. Second operand 7 states. [2019-12-07 16:55:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:53,136 INFO L93 Difference]: Finished difference Result 62533 states and 195722 transitions. [2019-12-07 16:55:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:55:53,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 16:55:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:53,227 INFO L225 Difference]: With dead ends: 62533 [2019-12-07 16:55:53,228 INFO L226 Difference]: Without dead ends: 62519 [2019-12-07 16:55:53,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:55:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62519 states. [2019-12-07 16:55:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62519 to 38429. [2019-12-07 16:55:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38429 states. [2019-12-07 16:55:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38429 states to 38429 states and 123216 transitions. [2019-12-07 16:55:54,089 INFO L78 Accepts]: Start accepts. Automaton has 38429 states and 123216 transitions. Word has length 22 [2019-12-07 16:55:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:54,089 INFO L462 AbstractCegarLoop]: Abstraction has 38429 states and 123216 transitions. [2019-12-07 16:55:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:55:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 38429 states and 123216 transitions. [2019-12-07 16:55:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:55:54,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:54,099 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 16:55:54,100 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 16:55:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-07 16:55:54,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:54,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161895499] [2019-12-07 16:55:54,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:54,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161895499] [2019-12-07 16:55:54,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:54,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:55:54,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536918367] [2019-12-07 16:55:54,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:55:54,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:54,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:55:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:55:54,144 INFO L87 Difference]: Start difference. First operand 38429 states and 123216 transitions. Second operand 5 states. [2019-12-07 16:55:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:54,543 INFO L93 Difference]: Finished difference Result 54199 states and 170621 transitions. [2019-12-07 16:55:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:55:54,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 16:55:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:54,626 INFO L225 Difference]: With dead ends: 54199 [2019-12-07 16:55:54,626 INFO L226 Difference]: Without dead ends: 54186 [2019-12-07 16:55:54,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:55:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-07 16:55:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 46269. [2019-12-07 16:55:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46269 states. [2019-12-07 16:55:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46269 states to 46269 states and 147756 transitions. [2019-12-07 16:55:56,342 INFO L78 Accepts]: Start accepts. Automaton has 46269 states and 147756 transitions. Word has length 25 [2019-12-07 16:55:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:56,343 INFO L462 AbstractCegarLoop]: Abstraction has 46269 states and 147756 transitions. [2019-12-07 16:55:56,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:55:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46269 states and 147756 transitions. [2019-12-07 16:55:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:55:56,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:56,356 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 16:55:56,357 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 16:55:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-07 16:55:56,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:56,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122247283] [2019-12-07 16:55:56,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:56,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122247283] [2019-12-07 16:55:56,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:56,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:55:56,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590726184] [2019-12-07 16:55:56,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:55:56,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:55:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:55:56,402 INFO L87 Difference]: Start difference. First operand 46269 states and 147756 transitions. Second operand 6 states. [2019-12-07 16:55:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:56,869 INFO L93 Difference]: Finished difference Result 67302 states and 209339 transitions. [2019-12-07 16:55:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:55:56,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 16:55:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:56,968 INFO L225 Difference]: With dead ends: 67302 [2019-12-07 16:55:56,968 INFO L226 Difference]: Without dead ends: 67262 [2019-12-07 16:55:56,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:55:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67262 states. [2019-12-07 16:55:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67262 to 49950. [2019-12-07 16:55:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49950 states. [2019-12-07 16:55:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49950 states to 49950 states and 158527 transitions. [2019-12-07 16:55:58,000 INFO L78 Accepts]: Start accepts. Automaton has 49950 states and 158527 transitions. Word has length 27 [2019-12-07 16:55:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:58,001 INFO L462 AbstractCegarLoop]: Abstraction has 49950 states and 158527 transitions. [2019-12-07 16:55:58,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:55:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 49950 states and 158527 transitions. [2019-12-07 16:55:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:55:58,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:58,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:55:58,020 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 16:55:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1649688558, now seen corresponding path program 1 times [2019-12-07 16:55:58,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:58,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236847841] [2019-12-07 16:55:58,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:58,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236847841] [2019-12-07 16:55:58,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:58,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:55:58,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825675029] [2019-12-07 16:55:58,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:55:58,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:55:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:55:58,065 INFO L87 Difference]: Start difference. First operand 49950 states and 158527 transitions. Second operand 4 states. [2019-12-07 16:55:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:58,124 INFO L93 Difference]: Finished difference Result 19137 states and 58196 transitions. [2019-12-07 16:55:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:55:58,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 16:55:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:58,148 INFO L225 Difference]: With dead ends: 19137 [2019-12-07 16:55:58,148 INFO L226 Difference]: Without dead ends: 19137 [2019-12-07 16:55:58,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:55:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19137 states. [2019-12-07 16:55:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19137 to 18045. [2019-12-07 16:55:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18045 states. [2019-12-07 16:55:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18045 states to 18045 states and 54852 transitions. [2019-12-07 16:55:58,549 INFO L78 Accepts]: Start accepts. Automaton has 18045 states and 54852 transitions. Word has length 29 [2019-12-07 16:55:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:58,549 INFO L462 AbstractCegarLoop]: Abstraction has 18045 states and 54852 transitions. [2019-12-07 16:55:58,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:55:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18045 states and 54852 transitions. [2019-12-07 16:55:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:55:58,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:58,568 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 16:55:58,569 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 16:55:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-07 16:55:58,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:58,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475684367] [2019-12-07 16:55:58,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:58,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475684367] [2019-12-07 16:55:58,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:58,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:55:58,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613773227] [2019-12-07 16:55:58,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:55:58,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:55:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:55:58,616 INFO L87 Difference]: Start difference. First operand 18045 states and 54852 transitions. Second operand 5 states. [2019-12-07 16:55:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:55:58,853 INFO L93 Difference]: Finished difference Result 20718 states and 62293 transitions. [2019-12-07 16:55:58,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:55:58,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 16:55:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:55:58,876 INFO L225 Difference]: With dead ends: 20718 [2019-12-07 16:55:58,876 INFO L226 Difference]: Without dead ends: 20718 [2019-12-07 16:55:58,876 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 16:55:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20718 states. [2019-12-07 16:55:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20718 to 18157. [2019-12-07 16:55:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18157 states. [2019-12-07 16:55:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18157 states to 18157 states and 55235 transitions. [2019-12-07 16:55:59,170 INFO L78 Accepts]: Start accepts. Automaton has 18157 states and 55235 transitions. Word has length 33 [2019-12-07 16:55:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:55:59,170 INFO L462 AbstractCegarLoop]: Abstraction has 18157 states and 55235 transitions. [2019-12-07 16:55:59,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:55:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 18157 states and 55235 transitions. [2019-12-07 16:55:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:55:59,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:55:59,187 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 16:55:59,187 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 16:55:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:55:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-07 16:55:59,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:55:59,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932749831] [2019-12-07 16:55:59,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:55:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:55:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:55:59,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932749831] [2019-12-07 16:55:59,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:55:59,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:55:59,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865666913] [2019-12-07 16:55:59,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:55:59,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:55:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:55:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:55:59,251 INFO L87 Difference]: Start difference. First operand 18157 states and 55235 transitions. Second operand 8 states. [2019-12-07 16:56:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:00,073 INFO L93 Difference]: Finished difference Result 25280 states and 74289 transitions. [2019-12-07 16:56:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 16:56:00,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 16:56:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:00,103 INFO L225 Difference]: With dead ends: 25280 [2019-12-07 16:56:00,104 INFO L226 Difference]: Without dead ends: 25280 [2019-12-07 16:56:00,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:56:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25280 states. [2019-12-07 16:56:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25280 to 17076. [2019-12-07 16:56:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17076 states. [2019-12-07 16:56:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17076 states to 17076 states and 51553 transitions. [2019-12-07 16:56:00,425 INFO L78 Accepts]: Start accepts. Automaton has 17076 states and 51553 transitions. Word has length 33 [2019-12-07 16:56:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:00,426 INFO L462 AbstractCegarLoop]: Abstraction has 17076 states and 51553 transitions. [2019-12-07 16:56:00,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:56:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17076 states and 51553 transitions. [2019-12-07 16:56:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:56:00,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:00,441 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 16:56:00,441 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 16:56:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -875459779, now seen corresponding path program 1 times [2019-12-07 16:56:00,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:00,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972245773] [2019-12-07 16:56:00,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:00,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972245773] [2019-12-07 16:56:00,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:00,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:56:00,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028825000] [2019-12-07 16:56:00,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:56:00,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:56:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:56:00,495 INFO L87 Difference]: Start difference. First operand 17076 states and 51553 transitions. Second operand 3 states. [2019-12-07 16:56:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:00,556 INFO L93 Difference]: Finished difference Result 16312 states and 48534 transitions. [2019-12-07 16:56:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:56:00,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 16:56:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:00,579 INFO L225 Difference]: With dead ends: 16312 [2019-12-07 16:56:00,579 INFO L226 Difference]: Without dead ends: 16312 [2019-12-07 16:56:00,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:56:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16312 states. [2019-12-07 16:56:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16312 to 16038. [2019-12-07 16:56:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16038 states. [2019-12-07 16:56:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16038 states to 16038 states and 47766 transitions. [2019-12-07 16:56:00,817 INFO L78 Accepts]: Start accepts. Automaton has 16038 states and 47766 transitions. Word has length 40 [2019-12-07 16:56:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:00,818 INFO L462 AbstractCegarLoop]: Abstraction has 16038 states and 47766 transitions. [2019-12-07 16:56:00,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:56:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 16038 states and 47766 transitions. [2019-12-07 16:56:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 16:56:00,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:00,831 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 16:56:00,831 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 16:56:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2067606308, now seen corresponding path program 1 times [2019-12-07 16:56:00,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:00,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778889853] [2019-12-07 16:56:00,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:00,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778889853] [2019-12-07 16:56:00,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:00,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:00,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929670207] [2019-12-07 16:56:00,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:56:00,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:56:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:56:00,870 INFO L87 Difference]: Start difference. First operand 16038 states and 47766 transitions. Second operand 5 states. [2019-12-07 16:56:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:00,918 INFO L93 Difference]: Finished difference Result 14678 states and 44802 transitions. [2019-12-07 16:56:00,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:56:00,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 16:56:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:00,935 INFO L225 Difference]: With dead ends: 14678 [2019-12-07 16:56:00,936 INFO L226 Difference]: Without dead ends: 14678 [2019-12-07 16:56:00,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:56:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14678 states. [2019-12-07 16:56:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14678 to 13382. [2019-12-07 16:56:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13382 states. [2019-12-07 16:56:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13382 states to 13382 states and 41074 transitions. [2019-12-07 16:56:01,160 INFO L78 Accepts]: Start accepts. Automaton has 13382 states and 41074 transitions. Word has length 41 [2019-12-07 16:56:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:01,160 INFO L462 AbstractCegarLoop]: Abstraction has 13382 states and 41074 transitions. [2019-12-07 16:56:01,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:56:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13382 states and 41074 transitions. [2019-12-07 16:56:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:56:01,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:01,174 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 16:56:01,174 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 16:56:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 338241501, now seen corresponding path program 1 times [2019-12-07 16:56:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:01,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449033541] [2019-12-07 16:56:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:01,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449033541] [2019-12-07 16:56:01,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:01,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:56:01,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946252079] [2019-12-07 16:56:01,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:56:01,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:56:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:56:01,212 INFO L87 Difference]: Start difference. First operand 13382 states and 41074 transitions. Second operand 3 states. [2019-12-07 16:56:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:01,282 INFO L93 Difference]: Finished difference Result 18284 states and 56386 transitions. [2019-12-07 16:56:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:56:01,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 16:56:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:01,305 INFO L225 Difference]: With dead ends: 18284 [2019-12-07 16:56:01,305 INFO L226 Difference]: Without dead ends: 18284 [2019-12-07 16:56:01,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:56:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18284 states. [2019-12-07 16:56:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18284 to 14580. [2019-12-07 16:56:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14580 states. [2019-12-07 16:56:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14580 states to 14580 states and 45263 transitions. [2019-12-07 16:56:01,556 INFO L78 Accepts]: Start accepts. Automaton has 14580 states and 45263 transitions. Word has length 66 [2019-12-07 16:56:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:01,557 INFO L462 AbstractCegarLoop]: Abstraction has 14580 states and 45263 transitions. [2019-12-07 16:56:01,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:56:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 14580 states and 45263 transitions. [2019-12-07 16:56:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:56:01,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:01,571 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 16:56:01,571 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 16:56:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:01,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1326528610, now seen corresponding path program 1 times [2019-12-07 16:56:01,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:01,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829999193] [2019-12-07 16:56:01,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:01,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829999193] [2019-12-07 16:56:01,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:01,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:56:01,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719174621] [2019-12-07 16:56:01,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:56:01,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:56:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:56:01,698 INFO L87 Difference]: Start difference. First operand 14580 states and 45263 transitions. Second operand 3 states. [2019-12-07 16:56:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:01,773 INFO L93 Difference]: Finished difference Result 17618 states and 54508 transitions. [2019-12-07 16:56:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:56:01,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 16:56:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:01,793 INFO L225 Difference]: With dead ends: 17618 [2019-12-07 16:56:01,793 INFO L226 Difference]: Without dead ends: 17618 [2019-12-07 16:56:01,794 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 16:56:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17618 states. [2019-12-07 16:56:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17618 to 14864. [2019-12-07 16:56:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14864 states. [2019-12-07 16:56:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14864 states to 14864 states and 46297 transitions. [2019-12-07 16:56:02,045 INFO L78 Accepts]: Start accepts. Automaton has 14864 states and 46297 transitions. Word has length 66 [2019-12-07 16:56:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:02,045 INFO L462 AbstractCegarLoop]: Abstraction has 14864 states and 46297 transitions. [2019-12-07 16:56:02,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:56:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14864 states and 46297 transitions. [2019-12-07 16:56:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:02,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:02,059 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 16:56:02,059 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 16:56:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash 323085019, now seen corresponding path program 1 times [2019-12-07 16:56:02,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:02,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81413375] [2019-12-07 16:56:02,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:02,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81413375] [2019-12-07 16:56:02,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:02,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:56:02,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616259304] [2019-12-07 16:56:02,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:02,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:02,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:02,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:02,119 INFO L87 Difference]: Start difference. First operand 14864 states and 46297 transitions. Second operand 4 states. [2019-12-07 16:56:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:02,196 INFO L93 Difference]: Finished difference Result 14864 states and 46115 transitions. [2019-12-07 16:56:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:02,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 16:56:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:02,214 INFO L225 Difference]: With dead ends: 14864 [2019-12-07 16:56:02,214 INFO L226 Difference]: Without dead ends: 14864 [2019-12-07 16:56:02,214 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 16:56:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14864 states. [2019-12-07 16:56:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14864 to 13293. [2019-12-07 16:56:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13293 states. [2019-12-07 16:56:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13293 states to 13293 states and 41260 transitions. [2019-12-07 16:56:02,438 INFO L78 Accepts]: Start accepts. Automaton has 13293 states and 41260 transitions. Word has length 67 [2019-12-07 16:56:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:02,439 INFO L462 AbstractCegarLoop]: Abstraction has 13293 states and 41260 transitions. [2019-12-07 16:56:02,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 13293 states and 41260 transitions. [2019-12-07 16:56:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:02,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:02,452 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 16:56:02,452 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 16:56:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-07 16:56:02,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:02,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4380538] [2019-12-07 16:56:02,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:02,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4380538] [2019-12-07 16:56:02,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:02,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:56:02,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999287316] [2019-12-07 16:56:02,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:56:02,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:02,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:56:02,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:56:02,638 INFO L87 Difference]: Start difference. First operand 13293 states and 41260 transitions. Second operand 11 states. [2019-12-07 16:56:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:03,596 INFO L93 Difference]: Finished difference Result 24371 states and 74289 transitions. [2019-12-07 16:56:03,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 16:56:03,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 16:56:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:03,614 INFO L225 Difference]: With dead ends: 24371 [2019-12-07 16:56:03,614 INFO L226 Difference]: Without dead ends: 17253 [2019-12-07 16:56:03,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:56:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17253 states. [2019-12-07 16:56:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17253 to 15170. [2019-12-07 16:56:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15170 states. [2019-12-07 16:56:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15170 states to 15170 states and 46878 transitions. [2019-12-07 16:56:03,864 INFO L78 Accepts]: Start accepts. Automaton has 15170 states and 46878 transitions. Word has length 67 [2019-12-07 16:56:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:03,864 INFO L462 AbstractCegarLoop]: Abstraction has 15170 states and 46878 transitions. [2019-12-07 16:56:03,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:56:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 15170 states and 46878 transitions. [2019-12-07 16:56:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:03,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:03,878 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 16:56:03,878 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 16:56:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -492001749, now seen corresponding path program 2 times [2019-12-07 16:56:03,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:03,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429984996] [2019-12-07 16:56:03,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:04,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429984996] [2019-12-07 16:56:04,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:04,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:56:04,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318969357] [2019-12-07 16:56:04,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:56:04,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:56:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:56:04,024 INFO L87 Difference]: Start difference. First operand 15170 states and 46878 transitions. Second operand 10 states. [2019-12-07 16:56:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:04,767 INFO L93 Difference]: Finished difference Result 21256 states and 64895 transitions. [2019-12-07 16:56:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 16:56:04,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 16:56:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:04,790 INFO L225 Difference]: With dead ends: 21256 [2019-12-07 16:56:04,790 INFO L226 Difference]: Without dead ends: 18457 [2019-12-07 16:56:04,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:56:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18457 states. [2019-12-07 16:56:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18457 to 15422. [2019-12-07 16:56:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15422 states. [2019-12-07 16:56:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15422 states to 15422 states and 47552 transitions. [2019-12-07 16:56:05,048 INFO L78 Accepts]: Start accepts. Automaton has 15422 states and 47552 transitions. Word has length 67 [2019-12-07 16:56:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:05,048 INFO L462 AbstractCegarLoop]: Abstraction has 15422 states and 47552 transitions. [2019-12-07 16:56:05,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:56:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15422 states and 47552 transitions. [2019-12-07 16:56:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:05,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:05,063 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 16:56:05,064 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 16:56:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash 693103783, now seen corresponding path program 3 times [2019-12-07 16:56:05,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:05,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057362958] [2019-12-07 16:56:05,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:05,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057362958] [2019-12-07 16:56:05,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:05,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:56:05,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165091508] [2019-12-07 16:56:05,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:56:05,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:56:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:56:05,210 INFO L87 Difference]: Start difference. First operand 15422 states and 47552 transitions. Second operand 11 states. [2019-12-07 16:56:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:06,543 INFO L93 Difference]: Finished difference Result 20096 states and 61116 transitions. [2019-12-07 16:56:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 16:56:06,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 16:56:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:06,581 INFO L225 Difference]: With dead ends: 20096 [2019-12-07 16:56:06,581 INFO L226 Difference]: Without dead ends: 17525 [2019-12-07 16:56:06,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:56:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17525 states. [2019-12-07 16:56:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17525 to 15278. [2019-12-07 16:56:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-07 16:56:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 47092 transitions. [2019-12-07 16:56:06,835 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 47092 transitions. Word has length 67 [2019-12-07 16:56:06,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:06,835 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 47092 transitions. [2019-12-07 16:56:06,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:56:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 47092 transitions. [2019-12-07 16:56:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:06,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:06,849 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 16:56:06,849 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 16:56:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 4 times [2019-12-07 16:56:06,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:06,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864583742] [2019-12-07 16:56:06,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:07,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864583742] [2019-12-07 16:56:07,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:07,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 16:56:07,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480975146] [2019-12-07 16:56:07,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:56:07,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:56:07,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:56:07,283 INFO L87 Difference]: Start difference. First operand 15278 states and 47092 transitions. Second operand 15 states. [2019-12-07 16:56:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:11,242 INFO L93 Difference]: Finished difference Result 19590 states and 59346 transitions. [2019-12-07 16:56:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 16:56:11,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 16:56:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:11,263 INFO L225 Difference]: With dead ends: 19590 [2019-12-07 16:56:11,263 INFO L226 Difference]: Without dead ends: 18481 [2019-12-07 16:56:11,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:56:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18481 states. [2019-12-07 16:56:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18481 to 16027. [2019-12-07 16:56:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16027 states. [2019-12-07 16:56:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16027 states to 16027 states and 49065 transitions. [2019-12-07 16:56:11,526 INFO L78 Accepts]: Start accepts. Automaton has 16027 states and 49065 transitions. Word has length 67 [2019-12-07 16:56:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:11,527 INFO L462 AbstractCegarLoop]: Abstraction has 16027 states and 49065 transitions. [2019-12-07 16:56:11,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:56:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 16027 states and 49065 transitions. [2019-12-07 16:56:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:11,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:11,542 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 16:56:11,542 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 16:56:11,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 5 times [2019-12-07 16:56:11,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:11,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079795678] [2019-12-07 16:56:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:11,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079795678] [2019-12-07 16:56:11,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:11,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:56:11,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388220017] [2019-12-07 16:56:11,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:56:11,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:56:11,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:56:11,666 INFO L87 Difference]: Start difference. First operand 16027 states and 49065 transitions. Second operand 10 states. [2019-12-07 16:56:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:12,436 INFO L93 Difference]: Finished difference Result 42074 states and 129126 transitions. [2019-12-07 16:56:12,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 16:56:12,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 16:56:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:12,470 INFO L225 Difference]: With dead ends: 42074 [2019-12-07 16:56:12,470 INFO L226 Difference]: Without dead ends: 29160 [2019-12-07 16:56:12,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 16:56:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29160 states. [2019-12-07 16:56:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29160 to 16512. [2019-12-07 16:56:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16512 states. [2019-12-07 16:56:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16512 states to 16512 states and 50481 transitions. [2019-12-07 16:56:12,816 INFO L78 Accepts]: Start accepts. Automaton has 16512 states and 50481 transitions. Word has length 67 [2019-12-07 16:56:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:12,816 INFO L462 AbstractCegarLoop]: Abstraction has 16512 states and 50481 transitions. [2019-12-07 16:56:12,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:56:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16512 states and 50481 transitions. [2019-12-07 16:56:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:12,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:12,831 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 16:56:12,831 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 16:56:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 6 times [2019-12-07 16:56:12,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:12,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945091785] [2019-12-07 16:56:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:13,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945091785] [2019-12-07 16:56:13,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:13,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:56:13,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152893582] [2019-12-07 16:56:13,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:56:13,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:13,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:56:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:56:13,019 INFO L87 Difference]: Start difference. First operand 16512 states and 50481 transitions. Second operand 11 states. [2019-12-07 16:56:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:13,707 INFO L93 Difference]: Finished difference Result 31248 states and 95302 transitions. [2019-12-07 16:56:13,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 16:56:13,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 16:56:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:13,780 INFO L225 Difference]: With dead ends: 31248 [2019-12-07 16:56:13,780 INFO L226 Difference]: Without dead ends: 30229 [2019-12-07 16:56:13,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:56:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30229 states. [2019-12-07 16:56:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30229 to 18760. [2019-12-07 16:56:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18760 states. [2019-12-07 16:56:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18760 states to 18760 states and 57571 transitions. [2019-12-07 16:56:14,157 INFO L78 Accepts]: Start accepts. Automaton has 18760 states and 57571 transitions. Word has length 67 [2019-12-07 16:56:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:14,157 INFO L462 AbstractCegarLoop]: Abstraction has 18760 states and 57571 transitions. [2019-12-07 16:56:14,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:56:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 18760 states and 57571 transitions. [2019-12-07 16:56:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:14,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:14,175 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 16:56:14,175 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 16:56:14,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 7 times [2019-12-07 16:56:14,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:14,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764090009] [2019-12-07 16:56:14,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:14,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764090009] [2019-12-07 16:56:14,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:14,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:56:14,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908813824] [2019-12-07 16:56:14,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:56:14,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:14,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:56:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:56:14,301 INFO L87 Difference]: Start difference. First operand 18760 states and 57571 transitions. Second operand 11 states. [2019-12-07 16:56:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:14,979 INFO L93 Difference]: Finished difference Result 30825 states and 93566 transitions. [2019-12-07 16:56:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 16:56:14,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 16:56:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:15,012 INFO L225 Difference]: With dead ends: 30825 [2019-12-07 16:56:15,012 INFO L226 Difference]: Without dead ends: 27972 [2019-12-07 16:56:15,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-07 16:56:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27972 states. [2019-12-07 16:56:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27972 to 16120. [2019-12-07 16:56:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16120 states. [2019-12-07 16:56:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16120 states to 16120 states and 49111 transitions. [2019-12-07 16:56:15,341 INFO L78 Accepts]: Start accepts. Automaton has 16120 states and 49111 transitions. Word has length 67 [2019-12-07 16:56:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 16120 states and 49111 transitions. [2019-12-07 16:56:15,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:56:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 16120 states and 49111 transitions. [2019-12-07 16:56:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:15,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:15,356 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 16:56:15,356 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 16:56:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 8 times [2019-12-07 16:56:15,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:15,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735970327] [2019-12-07 16:56:15,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:15,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735970327] [2019-12-07 16:56:15,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:15,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 16:56:15,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115589565] [2019-12-07 16:56:15,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 16:56:15,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 16:56:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:56:15,738 INFO L87 Difference]: Start difference. First operand 16120 states and 49111 transitions. Second operand 17 states. [2019-12-07 16:56:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:19,137 INFO L93 Difference]: Finished difference Result 20013 states and 59576 transitions. [2019-12-07 16:56:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 16:56:19,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-07 16:56:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:19,158 INFO L225 Difference]: With dead ends: 20013 [2019-12-07 16:56:19,158 INFO L226 Difference]: Without dead ends: 19562 [2019-12-07 16:56:19,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 16:56:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19562 states. [2019-12-07 16:56:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19562 to 16388. [2019-12-07 16:56:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16388 states. [2019-12-07 16:56:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 49781 transitions. [2019-12-07 16:56:19,429 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 49781 transitions. Word has length 67 [2019-12-07 16:56:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:19,429 INFO L462 AbstractCegarLoop]: Abstraction has 16388 states and 49781 transitions. [2019-12-07 16:56:19,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 16:56:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 49781 transitions. [2019-12-07 16:56:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:19,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:19,444 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 16:56:19,445 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 16:56:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2072610617, now seen corresponding path program 9 times [2019-12-07 16:56:19,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:19,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551695552] [2019-12-07 16:56:19,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:19,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551695552] [2019-12-07 16:56:19,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:19,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:56:19,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071941520] [2019-12-07 16:56:19,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:56:19,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:56:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:56:19,590 INFO L87 Difference]: Start difference. First operand 16388 states and 49781 transitions. Second operand 12 states. [2019-12-07 16:56:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:20,239 INFO L93 Difference]: Finished difference Result 28465 states and 85799 transitions. [2019-12-07 16:56:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:56:20,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 16:56:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:20,273 INFO L225 Difference]: With dead ends: 28465 [2019-12-07 16:56:20,274 INFO L226 Difference]: Without dead ends: 27870 [2019-12-07 16:56:20,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2019-12-07 16:56:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27870 states. [2019-12-07 16:56:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27870 to 15760. [2019-12-07 16:56:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15760 states. [2019-12-07 16:56:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15760 states to 15760 states and 48117 transitions. [2019-12-07 16:56:20,622 INFO L78 Accepts]: Start accepts. Automaton has 15760 states and 48117 transitions. Word has length 67 [2019-12-07 16:56:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:20,622 INFO L462 AbstractCegarLoop]: Abstraction has 15760 states and 48117 transitions. [2019-12-07 16:56:20,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:56:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 15760 states and 48117 transitions. [2019-12-07 16:56:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:20,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:20,637 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 16:56:20,637 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 16:56:20,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1014771687, now seen corresponding path program 10 times [2019-12-07 16:56:20,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:20,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321300000] [2019-12-07 16:56:20,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:20,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321300000] [2019-12-07 16:56:20,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:20,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:56:20,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774954201] [2019-12-07 16:56:20,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:56:20,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:56:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:56:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:56:20,720 INFO L87 Difference]: Start difference. First operand 15760 states and 48117 transitions. Second operand 8 states. [2019-12-07 16:56:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:20,973 INFO L93 Difference]: Finished difference Result 32541 states and 97127 transitions. [2019-12-07 16:56:20,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:56:20,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-07 16:56:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:21,005 INFO L225 Difference]: With dead ends: 32541 [2019-12-07 16:56:21,005 INFO L226 Difference]: Without dead ends: 27503 [2019-12-07 16:56:21,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:56:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27503 states. [2019-12-07 16:56:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27503 to 15549. [2019-12-07 16:56:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15549 states. [2019-12-07 16:56:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15549 states to 15549 states and 47572 transitions. [2019-12-07 16:56:21,327 INFO L78 Accepts]: Start accepts. Automaton has 15549 states and 47572 transitions. Word has length 67 [2019-12-07 16:56:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:21,328 INFO L462 AbstractCegarLoop]: Abstraction has 15549 states and 47572 transitions. [2019-12-07 16:56:21,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:56:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15549 states and 47572 transitions. [2019-12-07 16:56:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:56:21,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:21,342 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 16:56:21,342 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 11 times [2019-12-07 16:56:21,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:56:21,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332128962] [2019-12-07 16:56:21,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:56:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:56:21,411 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:56:21,412 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:56:21,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_33|) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_23|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_33| 4) |v_#length_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33|)) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33|) |v_ULTIMATE.start_main_~#t257~0.offset_23| 0)) |v_#memory_int_19|) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33| 1) |v_#valid_63|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_33|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 16:56:21,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_22 0)) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_240 256) 0)) (not (= (mod v_~a$w_buff1_used~0_130 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_18|) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_22 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_18|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_18) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_18|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 16:56:21,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 16:56:21,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 16:56:21,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1150389372 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1150389372 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1150389372| ~a~0_In-1150389372)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1150389372| ~a$w_buff1~0_In-1150389372)))) InVars {~a~0=~a~0_In-1150389372, ~a$w_buff1~0=~a$w_buff1~0_In-1150389372, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1150389372, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150389372} OutVars{~a~0=~a~0_In-1150389372, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1150389372|, ~a$w_buff1~0=~a$w_buff1~0_In-1150389372, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1150389372, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150389372} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 16:56:21,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_14| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_14|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_13|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_21|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 16:56:21,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In83142430 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In83142430 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out83142430| ~a$w_buff0_used~0_In83142430) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out83142430| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In83142430, ~a$w_buff0_used~0=~a$w_buff0_used~0_In83142430} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In83142430, ~a$w_buff0_used~0=~a$w_buff0_used~0_In83142430, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out83142430|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:56:21,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1835266869 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1835266869 256) 0))) (or (and (= ~a$w_buff0_used~0_In1835266869 |P0Thread1of1ForFork1_#t~ite5_Out1835266869|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1835266869|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1835266869, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1835266869} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1835266869|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835266869, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1835266869} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 16:56:21,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd1~0_In-174615172 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-174615172 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-174615172 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-174615172 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-174615172|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-174615172 |P0Thread1of1ForFork1_#t~ite6_Out-174615172|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-174615172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-174615172, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-174615172, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-174615172} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-174615172|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-174615172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-174615172, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-174615172, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-174615172} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:56:21,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-7714752 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-7714752 256) 0)) (.cse1 (= ~a$r_buff0_thd1~0_In-7714752 ~a$r_buff0_thd1~0_Out-7714752))) (or (and .cse0 .cse1) (and (= ~a$r_buff0_thd1~0_Out-7714752 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-7714752, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-7714752} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-7714752|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-7714752, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-7714752} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:56:21,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1162988879 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1162988879 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1162988879 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1162988879 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1162988879| ~a$r_buff1_thd1~0_In1162988879)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite8_Out1162988879| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1162988879, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1162988879, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1162988879, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1162988879} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1162988879|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1162988879, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1162988879, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1162988879, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1162988879} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:56:21,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_48|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_47|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:56:21,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-951770828 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-951770828| ~a$w_buff0~0_In-951770828) (= |P2Thread1of1ForFork0_#t~ite20_In-951770828| |P2Thread1of1ForFork0_#t~ite20_Out-951770828|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-951770828| |P2Thread1of1ForFork0_#t~ite20_Out-951770828|) (= ~a$w_buff0~0_In-951770828 |P2Thread1of1ForFork0_#t~ite20_Out-951770828|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-951770828 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-951770828 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-951770828 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-951770828 256) 0))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-951770828, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-951770828, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-951770828, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-951770828, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-951770828, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-951770828|, ~weak$$choice2~0=~weak$$choice2~0_In-951770828} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-951770828|, ~a$w_buff0~0=~a$w_buff0~0_In-951770828, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-951770828, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-951770828, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-951770828, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-951770828|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-951770828, ~weak$$choice2~0=~weak$$choice2~0_In-951770828} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 16:56:21,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In262755449 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In262755449| |P2Thread1of1ForFork0_#t~ite26_Out262755449|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out262755449| ~a$w_buff0_used~0_In262755449)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out262755449| ~a$w_buff0_used~0_In262755449) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out262755449| |P2Thread1of1ForFork0_#t~ite26_Out262755449|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In262755449 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In262755449 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In262755449 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In262755449 256)))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In262755449|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In262755449, ~a$w_buff0_used~0=~a$w_buff0_used~0_In262755449, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In262755449, ~a$w_buff1_used~0=~a$w_buff1_used~0_In262755449, ~weak$$choice2~0=~weak$$choice2~0_In262755449} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out262755449|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out262755449|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In262755449, ~a$w_buff0_used~0=~a$w_buff0_used~0_In262755449, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In262755449, ~a$w_buff1_used~0=~a$w_buff1_used~0_In262755449, ~weak$$choice2~0=~weak$$choice2~0_In262755449} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 16:56:21,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_5|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_5|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_5|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:56:21,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 16:56:21,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1095525177 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1095525177 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1095525177| |P2Thread1of1ForFork0_#t~ite39_Out1095525177|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~a$w_buff1~0_In1095525177 |P2Thread1of1ForFork0_#t~ite38_Out1095525177|)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1095525177| ~a~0_In1095525177) (or .cse1 .cse0) .cse2))) InVars {~a~0=~a~0_In1095525177, ~a$w_buff1~0=~a$w_buff1~0_In1095525177, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1095525177, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1095525177} OutVars{~a~0=~a~0_In1095525177, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1095525177|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1095525177|, ~a$w_buff1~0=~a$w_buff1~0_In1095525177, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1095525177, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1095525177} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 16:56:21,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In426257613 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In426257613 256)))) (or (and (= ~a$w_buff0_used~0_In426257613 |P2Thread1of1ForFork0_#t~ite40_Out426257613|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out426257613| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In426257613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In426257613} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out426257613|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In426257613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In426257613} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 16:56:21,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1402311375 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1402311375 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1402311375 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1402311375 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1402311375 |P2Thread1of1ForFork0_#t~ite41_Out-1402311375|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1402311375|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1402311375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1402311375, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1402311375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1402311375} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1402311375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1402311375, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1402311375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1402311375, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1402311375|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 16:56:21,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1777596281 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In1777596281 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1777596281 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1777596281 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1777596281| 0)) (and (= ~a$w_buff1_used~0_In1777596281 |P1Thread1of1ForFork2_#t~ite12_Out1777596281|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1777596281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1777596281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1777596281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1777596281} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1777596281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1777596281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1777596281, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1777596281|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1777596281} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 16:56:21,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In76164877 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In76164877 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out76164877| ~a$r_buff0_thd2~0_In76164877)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out76164877| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In76164877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In76164877} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In76164877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In76164877, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out76164877|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 16:56:21,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In-2119238586 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2119238586 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-2119238586 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2119238586 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-2119238586 |P1Thread1of1ForFork2_#t~ite14_Out-2119238586|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2119238586|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2119238586, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2119238586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2119238586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2119238586} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2119238586, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2119238586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2119238586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2119238586, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2119238586|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:56:21,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_34| v_~a$r_buff1_thd2~0_63) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 16:56:21,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1805749016 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1805749016 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1805749016| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1805749016| ~a$r_buff0_thd3~0_In1805749016) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1805749016, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1805749016} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1805749016, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1805749016, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1805749016|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:56:21,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1599446918 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1599446918 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1599446918 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1599446918 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out1599446918| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In1599446918 |P2Thread1of1ForFork0_#t~ite43_Out1599446918|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1599446918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599446918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1599446918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1599446918} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1599446918|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1599446918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599446918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1599446918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1599446918} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 16:56:21,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_35|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:56:21,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_40) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:56:21,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-3297567 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-3297567 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-3297567| ~a$w_buff1~0_In-3297567) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-3297567| ~a~0_In-3297567)))) InVars {~a~0=~a~0_In-3297567, ~a$w_buff1~0=~a$w_buff1~0_In-3297567, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-3297567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-3297567} OutVars{~a~0=~a~0_In-3297567, ~a$w_buff1~0=~a$w_buff1~0_In-3297567, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-3297567|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-3297567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-3297567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 16:56:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 16:56:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In64722678 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In64722678 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out64722678| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In64722678 |ULTIMATE.start_main_#t~ite49_Out64722678|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In64722678, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In64722678} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In64722678, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out64722678|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In64722678} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 16:56:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In1401693918 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1401693918 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1401693918 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1401693918 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1401693918|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1401693918 |ULTIMATE.start_main_#t~ite50_Out1401693918|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1401693918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1401693918, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1401693918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1401693918} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1401693918|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1401693918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1401693918, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1401693918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1401693918} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 16:56:21,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-191350931 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-191350931 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-191350931 |ULTIMATE.start_main_#t~ite51_Out-191350931|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-191350931|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-191350931, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-191350931} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-191350931|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-191350931, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-191350931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 16:56:21,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-386699446 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-386699446 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-386699446 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-386699446 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-386699446| ~a$r_buff1_thd0~0_In-386699446)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-386699446| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-386699446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386699446, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-386699446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-386699446} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-386699446|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-386699446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386699446, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-386699446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-386699446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 16:56:21,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~main$tmp_guard1~0_12 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_~__unbuffered_p2_EBX~0_22 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:56:21,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:56:21 BasicIcfg [2019-12-07 16:56:21,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:56:21,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:56:21,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:56:21,494 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:56:21,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:54:20" (3/4) ... [2019-12-07 16:56:21,497 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:56:21,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_33|) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_23|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_33| 4) |v_#length_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33|)) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33|) |v_ULTIMATE.start_main_~#t257~0.offset_23| 0)) |v_#memory_int_19|) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33| 1) |v_#valid_63|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_33|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 16:56:21,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_22 0)) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_240 256) 0)) (not (= (mod v_~a$w_buff1_used~0_130 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_18|) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_22 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_18|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_18) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_18|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 16:56:21,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 16:56:21,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 16:56:21,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1150389372 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1150389372 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1150389372| ~a~0_In-1150389372)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1150389372| ~a$w_buff1~0_In-1150389372)))) InVars {~a~0=~a~0_In-1150389372, ~a$w_buff1~0=~a$w_buff1~0_In-1150389372, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1150389372, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150389372} OutVars{~a~0=~a~0_In-1150389372, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1150389372|, ~a$w_buff1~0=~a$w_buff1~0_In-1150389372, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1150389372, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150389372} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 16:56:21,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_14| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_14|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_13|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_21|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 16:56:21,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In83142430 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In83142430 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out83142430| ~a$w_buff0_used~0_In83142430) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out83142430| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In83142430, ~a$w_buff0_used~0=~a$w_buff0_used~0_In83142430} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In83142430, ~a$w_buff0_used~0=~a$w_buff0_used~0_In83142430, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out83142430|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:56:21,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1835266869 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1835266869 256) 0))) (or (and (= ~a$w_buff0_used~0_In1835266869 |P0Thread1of1ForFork1_#t~ite5_Out1835266869|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1835266869|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1835266869, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1835266869} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1835266869|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835266869, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1835266869} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 16:56:21,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd1~0_In-174615172 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-174615172 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-174615172 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-174615172 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-174615172|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-174615172 |P0Thread1of1ForFork1_#t~ite6_Out-174615172|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-174615172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-174615172, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-174615172, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-174615172} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-174615172|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-174615172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-174615172, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-174615172, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-174615172} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:56:21,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-7714752 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-7714752 256) 0)) (.cse1 (= ~a$r_buff0_thd1~0_In-7714752 ~a$r_buff0_thd1~0_Out-7714752))) (or (and .cse0 .cse1) (and (= ~a$r_buff0_thd1~0_Out-7714752 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-7714752, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-7714752} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-7714752|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-7714752, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-7714752} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:56:21,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1162988879 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1162988879 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1162988879 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1162988879 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1162988879| ~a$r_buff1_thd1~0_In1162988879)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite8_Out1162988879| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1162988879, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1162988879, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1162988879, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1162988879} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1162988879|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1162988879, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1162988879, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1162988879, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1162988879} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:56:21,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_48|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_47|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:56:21,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-951770828 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-951770828| ~a$w_buff0~0_In-951770828) (= |P2Thread1of1ForFork0_#t~ite20_In-951770828| |P2Thread1of1ForFork0_#t~ite20_Out-951770828|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-951770828| |P2Thread1of1ForFork0_#t~ite20_Out-951770828|) (= ~a$w_buff0~0_In-951770828 |P2Thread1of1ForFork0_#t~ite20_Out-951770828|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-951770828 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-951770828 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-951770828 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-951770828 256) 0))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-951770828, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-951770828, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-951770828, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-951770828, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-951770828, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-951770828|, ~weak$$choice2~0=~weak$$choice2~0_In-951770828} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-951770828|, ~a$w_buff0~0=~a$w_buff0~0_In-951770828, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-951770828, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-951770828, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-951770828, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-951770828|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-951770828, ~weak$$choice2~0=~weak$$choice2~0_In-951770828} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 16:56:21,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In262755449 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In262755449| |P2Thread1of1ForFork0_#t~ite26_Out262755449|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out262755449| ~a$w_buff0_used~0_In262755449)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out262755449| ~a$w_buff0_used~0_In262755449) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out262755449| |P2Thread1of1ForFork0_#t~ite26_Out262755449|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In262755449 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In262755449 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In262755449 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In262755449 256)))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In262755449|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In262755449, ~a$w_buff0_used~0=~a$w_buff0_used~0_In262755449, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In262755449, ~a$w_buff1_used~0=~a$w_buff1_used~0_In262755449, ~weak$$choice2~0=~weak$$choice2~0_In262755449} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out262755449|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out262755449|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In262755449, ~a$w_buff0_used~0=~a$w_buff0_used~0_In262755449, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In262755449, ~a$w_buff1_used~0=~a$w_buff1_used~0_In262755449, ~weak$$choice2~0=~weak$$choice2~0_In262755449} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 16:56:21,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_5|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_5|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_5|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:56:21,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 16:56:21,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1095525177 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1095525177 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1095525177| |P2Thread1of1ForFork0_#t~ite39_Out1095525177|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~a$w_buff1~0_In1095525177 |P2Thread1of1ForFork0_#t~ite38_Out1095525177|)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1095525177| ~a~0_In1095525177) (or .cse1 .cse0) .cse2))) InVars {~a~0=~a~0_In1095525177, ~a$w_buff1~0=~a$w_buff1~0_In1095525177, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1095525177, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1095525177} OutVars{~a~0=~a~0_In1095525177, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1095525177|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1095525177|, ~a$w_buff1~0=~a$w_buff1~0_In1095525177, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1095525177, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1095525177} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 16:56:21,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In426257613 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In426257613 256)))) (or (and (= ~a$w_buff0_used~0_In426257613 |P2Thread1of1ForFork0_#t~ite40_Out426257613|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out426257613| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In426257613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In426257613} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out426257613|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In426257613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In426257613} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 16:56:21,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1402311375 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1402311375 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1402311375 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1402311375 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1402311375 |P2Thread1of1ForFork0_#t~ite41_Out-1402311375|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1402311375|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1402311375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1402311375, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1402311375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1402311375} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1402311375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1402311375, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1402311375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1402311375, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1402311375|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 16:56:21,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1777596281 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In1777596281 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1777596281 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1777596281 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1777596281| 0)) (and (= ~a$w_buff1_used~0_In1777596281 |P1Thread1of1ForFork2_#t~ite12_Out1777596281|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1777596281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1777596281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1777596281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1777596281} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1777596281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1777596281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1777596281, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1777596281|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1777596281} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 16:56:21,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In76164877 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In76164877 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out76164877| ~a$r_buff0_thd2~0_In76164877)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out76164877| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In76164877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In76164877} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In76164877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In76164877, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out76164877|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 16:56:21,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In-2119238586 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2119238586 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-2119238586 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2119238586 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-2119238586 |P1Thread1of1ForFork2_#t~ite14_Out-2119238586|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2119238586|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2119238586, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2119238586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2119238586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2119238586} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2119238586, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2119238586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2119238586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2119238586, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2119238586|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:56:21,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_34| v_~a$r_buff1_thd2~0_63) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 16:56:21,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1805749016 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1805749016 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1805749016| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1805749016| ~a$r_buff0_thd3~0_In1805749016) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1805749016, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1805749016} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1805749016, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1805749016, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1805749016|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:56:21,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1599446918 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1599446918 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1599446918 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1599446918 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out1599446918| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In1599446918 |P2Thread1of1ForFork0_#t~ite43_Out1599446918|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1599446918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599446918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1599446918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1599446918} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1599446918|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1599446918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599446918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1599446918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1599446918} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 16:56:21,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_35|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:56:21,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_40) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:56:21,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-3297567 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-3297567 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-3297567| ~a$w_buff1~0_In-3297567) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-3297567| ~a~0_In-3297567)))) InVars {~a~0=~a~0_In-3297567, ~a$w_buff1~0=~a$w_buff1~0_In-3297567, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-3297567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-3297567} OutVars{~a~0=~a~0_In-3297567, ~a$w_buff1~0=~a$w_buff1~0_In-3297567, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-3297567|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-3297567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-3297567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 16:56:21,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 16:56:21,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In64722678 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In64722678 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out64722678| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In64722678 |ULTIMATE.start_main_#t~ite49_Out64722678|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In64722678, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In64722678} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In64722678, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out64722678|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In64722678} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 16:56:21,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In1401693918 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1401693918 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1401693918 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1401693918 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1401693918|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1401693918 |ULTIMATE.start_main_#t~ite50_Out1401693918|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1401693918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1401693918, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1401693918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1401693918} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1401693918|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1401693918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1401693918, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1401693918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1401693918} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 16:56:21,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-191350931 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-191350931 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-191350931 |ULTIMATE.start_main_#t~ite51_Out-191350931|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-191350931|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-191350931, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-191350931} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-191350931|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-191350931, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-191350931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 16:56:21,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-386699446 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-386699446 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-386699446 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-386699446 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-386699446| ~a$r_buff1_thd0~0_In-386699446)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-386699446| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-386699446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386699446, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-386699446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-386699446} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-386699446|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-386699446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386699446, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-386699446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-386699446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 16:56:21,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~main$tmp_guard1~0_12 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_~__unbuffered_p2_EBX~0_22 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:56:21,585 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2e3554ea-5159-4983-8b75-2d4888feef2f/bin/utaipan/witness.graphml [2019-12-07 16:56:21,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:56:21,586 INFO L168 Benchmark]: Toolchain (without parser) took 122293.88 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 939.9 MB in the beginning and 5.3 GB in the end (delta: -4.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 16:56:21,587 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:56:21,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:56:21,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.70 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 16:56:21,587 INFO L168 Benchmark]: Boogie Preprocessor took 25.47 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 16:56:21,588 INFO L168 Benchmark]: RCFGBuilder took 405.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:56:21,588 INFO L168 Benchmark]: TraceAbstraction took 121347.28 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.6 GB). Free memory was 996.6 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:56:21,588 INFO L168 Benchmark]: Witness Printer took 90.85 ms. Allocated memory is still 6.8 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:56:21,590 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.70 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 25.47 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 405.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 121347.28 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.6 GB). Free memory was 996.6 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 90.85 ms. Allocated memory is still 6.8 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) 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=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 121.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6614 SDtfs, 8921 SDslu, 27207 SDs, 0 SdLazy, 12956 SolverSat, 369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 29 SyntacticMatches, 22 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230321occurred 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: 70.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 242242 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1171 ConstructedInterpolants, 0 QuantifiedInterpolants, 684347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...