./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/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 e4a72557a25d3ff27b5a7864de9df538301d131d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-6b5699a [2019-11-26 02:56:06,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:56:06,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:56:07,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:56:07,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:56:07,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:56:07,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:56:07,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:56:07,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:56:07,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:56:07,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:56:07,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:56:07,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:56:07,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:56:07,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:56:07,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:56:07,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:56:07,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:56:07,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:56:07,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:56:07,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:56:07,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:56:07,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:56:07,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:56:07,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:56:07,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:56:07,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:56:07,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:56:07,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:56:07,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:56:07,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:56:07,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:56:07,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:56:07,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:56:07,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:56:07,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:56:07,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:56:07,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:56:07,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:56:07,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:56:07,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:56:07,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:56:07,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:56:07,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:56:07,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:56:07,074 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:56:07,074 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:56:07,075 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:56:07,075 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:56:07,075 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:56:07,075 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:56:07,075 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:56:07,075 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:56:07,076 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:56:07,076 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:56:07,076 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:56:07,076 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:56:07,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:56:07,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:56:07,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:56:07,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:56:07,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:56:07,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:56:07,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:56:07,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:56:07,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:56:07,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:56:07,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:56:07,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:56:07,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:56:07,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:56:07,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:56:07,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:56:07,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:56:07,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:56:07,080 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:56:07,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:56:07,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:56:07,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:56:07,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_c6e0d06e-67a3-4d33-8107-486d1fa75dea/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 -> e4a72557a25d3ff27b5a7864de9df538301d131d [2019-11-26 02:56:07,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:56:07,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:56:07,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:56:07,247 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:56:07,252 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:56:07,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-26 02:56:07,309 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/data/c9d637f85/24214e25588c40d584c25adc3082db38/FLAG3f0948c7a [2019-11-26 02:56:07,797 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:56:07,800 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-26 02:56:07,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/data/c9d637f85/24214e25588c40d584c25adc3082db38/FLAG3f0948c7a [2019-11-26 02:56:08,133 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/data/c9d637f85/24214e25588c40d584c25adc3082db38 [2019-11-26 02:56:08,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:56:08,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:56:08,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:08,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:56:08,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:56:08,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568b4aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08, skipping insertion in model container [2019-11-26 02:56:08,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:56:08,198 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:56:08,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:08,620 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:56:08,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:08,769 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:56:08,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08 WrapperNode [2019-11-26 02:56:08,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:08,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:08,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:56:08,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:56:08,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:08,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:56:08,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:56:08,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:56:08,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... [2019-11-26 02:56:08,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:56:08,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:56:08,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:56:08,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:56:08,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/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-11-26 02:56:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:56:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-26 02:56:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:56:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:56:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-26 02:56:08,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-26 02:56:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-26 02:56:08,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-26 02:56:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-26 02:56:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:56:08,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:56:08,930 WARN L202 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-26 02:56:09,491 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:56:09,493 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-26 02:56:09,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:09 BoogieIcfgContainer [2019-11-26 02:56:09,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:56:09,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:56:09,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:56:09,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:56:09,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:56:08" (1/3) ... [2019-11-26 02:56:09,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f03252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:09, skipping insertion in model container [2019-11-26 02:56:09,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:08" (2/3) ... [2019-11-26 02:56:09,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f03252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:09, skipping insertion in model container [2019-11-26 02:56:09,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:09" (3/3) ... [2019-11-26 02:56:09,508 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-11-26 02:56:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:56:09,725 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-26 02:56:09,725 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:56:09,732 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-26 02:56:09,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-26 02:56:09,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:56:09,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:56:09,759 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:56:09,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:56:09,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:56:09,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:56:09,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:56:09,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:56:09,776 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 277 places, 353 transitions [2019-11-26 02:56:11,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-11-26 02:56:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-11-26 02:56:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:56:11,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:11,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:11,749 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash -870107987, now seen corresponding path program 1 times [2019-11-26 02:56:11,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:11,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714512872] [2019-11-26 02:56:11,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:12,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714512872] [2019-11-26 02:56:12,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:12,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:12,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234405077] [2019-11-26 02:56:12,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:12,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:12,091 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-11-26 02:56:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:12,670 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-11-26 02:56:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:56:12,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-26 02:56:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:12,891 INFO L225 Difference]: With dead ends: 26619 [2019-11-26 02:56:12,891 INFO L226 Difference]: Without dead ends: 20363 [2019-11-26 02:56:12,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-11-26 02:56:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-11-26 02:56:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-11-26 02:56:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-11-26 02:56:13,974 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-11-26 02:56:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:13,974 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-11-26 02:56:13,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-11-26 02:56:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:56:13,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:13,987 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] [2019-11-26 02:56:13,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:13,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1372959301, now seen corresponding path program 1 times [2019-11-26 02:56:13,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:13,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135359456] [2019-11-26 02:56:13,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:14,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135359456] [2019-11-26 02:56:14,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:14,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:14,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753885077] [2019-11-26 02:56:14,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:56:14,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:14,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:56:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:14,144 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-11-26 02:56:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:15,135 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-11-26 02:56:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:56:15,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-26 02:56:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:15,261 INFO L225 Difference]: With dead ends: 31841 [2019-11-26 02:56:15,261 INFO L226 Difference]: Without dead ends: 31289 [2019-11-26 02:56:15,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-11-26 02:56:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-11-26 02:56:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-11-26 02:56:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-11-26 02:56:16,225 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-11-26 02:56:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:16,226 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-11-26 02:56:16,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:56:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-11-26 02:56:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:56:16,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:16,233 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] [2019-11-26 02:56:16,233 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:16,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:16,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1695795612, now seen corresponding path program 1 times [2019-11-26 02:56:16,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:16,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133508655] [2019-11-26 02:56:16,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:16,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133508655] [2019-11-26 02:56:16,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:16,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:16,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146897500] [2019-11-26 02:56:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:56:16,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:56:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:16,637 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 5 states. [2019-11-26 02:56:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:17,132 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-11-26 02:56:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:56:17,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-26 02:56:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:17,303 INFO L225 Difference]: With dead ends: 38699 [2019-11-26 02:56:17,303 INFO L226 Difference]: Without dead ends: 38251 [2019-11-26 02:56:17,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-11-26 02:56:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-11-26 02:56:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-11-26 02:56:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-11-26 02:56:18,636 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-11-26 02:56:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:18,637 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-11-26 02:56:18,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:56:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-11-26 02:56:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 02:56:18,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:18,647 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] [2019-11-26 02:56:18,647 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1134070006, now seen corresponding path program 1 times [2019-11-26 02:56:18,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:18,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424846701] [2019-11-26 02:56:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:18,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424846701] [2019-11-26 02:56:18,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:18,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:18,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095626951] [2019-11-26 02:56:18,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:56:18,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:18,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:56:18,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:56:18,684 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 3 states. [2019-11-26 02:56:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:18,901 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-11-26 02:56:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:18,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-26 02:56:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:19,003 INFO L225 Difference]: With dead ends: 42415 [2019-11-26 02:56:19,003 INFO L226 Difference]: Without dead ends: 42415 [2019-11-26 02:56:19,003 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-11-26 02:56:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-11-26 02:56:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-11-26 02:56:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-11-26 02:56:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-11-26 02:56:19,931 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-11-26 02:56:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:19,932 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-11-26 02:56:19,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:56:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-11-26 02:56:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:56:19,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:19,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:19,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 125714386, now seen corresponding path program 1 times [2019-11-26 02:56:19,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:19,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288853111] [2019-11-26 02:56:19,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288853111] [2019-11-26 02:56:20,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:20,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:20,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908529148] [2019-11-26 02:56:20,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:20,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:20,085 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 6 states. [2019-11-26 02:56:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:21,192 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-11-26 02:56:21,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:56:21,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-26 02:56:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:21,317 INFO L225 Difference]: With dead ends: 51814 [2019-11-26 02:56:21,317 INFO L226 Difference]: Without dead ends: 51014 [2019-11-26 02:56:21,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-11-26 02:56:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-11-26 02:56:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-11-26 02:56:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-11-26 02:56:22,235 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-11-26 02:56:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:22,236 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-11-26 02:56:22,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-11-26 02:56:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:56:22,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:22,254 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] [2019-11-26 02:56:22,254 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:22,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1671236973, now seen corresponding path program 1 times [2019-11-26 02:56:22,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:22,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390550609] [2019-11-26 02:56:22,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:22,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-11-26 02:56:22,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390550609] [2019-11-26 02:56:22,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:22,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:56:22,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593946972] [2019-11-26 02:56:22,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:56:22,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:56:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:56:22,388 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 7 states. [2019-11-26 02:56:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:23,768 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-11-26 02:56:23,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:56:23,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-26 02:56:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:23,899 INFO L225 Difference]: With dead ends: 68550 [2019-11-26 02:56:23,899 INFO L226 Difference]: Without dead ends: 68550 [2019-11-26 02:56:23,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:56:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-11-26 02:56:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-11-26 02:56:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-11-26 02:56:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-11-26 02:56:25,102 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-11-26 02:56:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:25,103 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-11-26 02:56:25,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:56:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-11-26 02:56:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:56:25,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:25,116 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] [2019-11-26 02:56:25,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash -783733292, now seen corresponding path program 1 times [2019-11-26 02:56:25,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:25,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191249069] [2019-11-26 02:56:25,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:25,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191249069] [2019-11-26 02:56:25,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:25,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:25,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552998038] [2019-11-26 02:56:25,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:25,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:25,208 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-11-26 02:56:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:25,274 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-11-26 02:56:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:56:25,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-26 02:56:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:25,291 INFO L225 Difference]: With dead ends: 10469 [2019-11-26 02:56:25,292 INFO L226 Difference]: Without dead ends: 9223 [2019-11-26 02:56:25,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-11-26 02:56:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-11-26 02:56:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-11-26 02:56:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-11-26 02:56:25,473 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-11-26 02:56:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:25,473 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-11-26 02:56:25,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-11-26 02:56:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:56:25,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:25,475 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] [2019-11-26 02:56:25,476 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash -800467883, now seen corresponding path program 1 times [2019-11-26 02:56:25,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:25,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766674905] [2019-11-26 02:56:25,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:25,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766674905] [2019-11-26 02:56:25,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:25,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:25,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410894073] [2019-11-26 02:56:25,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:25,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:25,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:25,545 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 6 states. [2019-11-26 02:56:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:25,946 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-11-26 02:56:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:56:25,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-26 02:56:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:25,960 INFO L225 Difference]: With dead ends: 11222 [2019-11-26 02:56:25,961 INFO L226 Difference]: Without dead ends: 11135 [2019-11-26 02:56:25,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:56:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-11-26 02:56:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-11-26 02:56:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-11-26 02:56:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-11-26 02:56:26,227 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-11-26 02:56:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:26,228 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-11-26 02:56:26,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-11-26 02:56:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:56:26,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:26,232 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-11-26 02:56:26,232 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1357400536, now seen corresponding path program 1 times [2019-11-26 02:56:26,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:26,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005496908] [2019-11-26 02:56:26,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005496908] [2019-11-26 02:56:26,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:26,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:26,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101368074] [2019-11-26 02:56:26,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:26,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:26,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:26,293 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 4 states. [2019-11-26 02:56:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:26,408 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-11-26 02:56:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:56:26,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:56:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:26,422 INFO L225 Difference]: With dead ends: 10891 [2019-11-26 02:56:26,422 INFO L226 Difference]: Without dead ends: 10891 [2019-11-26 02:56:26,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-26 02:56:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-11-26 02:56:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-11-26 02:56:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-11-26 02:56:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-11-26 02:56:26,551 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-11-26 02:56:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-11-26 02:56:26,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-11-26 02:56:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:56:26,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:26,557 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-11-26 02:56:26,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 385409799, now seen corresponding path program 1 times [2019-11-26 02:56:26,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:26,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141765656] [2019-11-26 02:56:26,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:26,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141765656] [2019-11-26 02:56:26,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:26,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:26,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217817717] [2019-11-26 02:56:26,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:26,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:26,634 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 6 states. [2019-11-26 02:56:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:27,079 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-11-26 02:56:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:56:27,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-26 02:56:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:27,098 INFO L225 Difference]: With dead ends: 12789 [2019-11-26 02:56:27,098 INFO L226 Difference]: Without dead ends: 12741 [2019-11-26 02:56:27,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:56:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-11-26 02:56:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-11-26 02:56:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-11-26 02:56:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-11-26 02:56:27,269 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-11-26 02:56:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:27,269 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-11-26 02:56:27,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-11-26 02:56:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:56:27,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:27,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:27,278 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2019249902, now seen corresponding path program 1 times [2019-11-26 02:56:27,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:27,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880285866] [2019-11-26 02:56:27,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:27,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880285866] [2019-11-26 02:56:27,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:27,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:27,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502740112] [2019-11-26 02:56:27,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:27,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:27,381 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-11-26 02:56:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:27,658 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-11-26 02:56:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:56:27,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-26 02:56:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:27,677 INFO L225 Difference]: With dead ends: 13324 [2019-11-26 02:56:27,678 INFO L226 Difference]: Without dead ends: 13324 [2019-11-26 02:56:27,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-11-26 02:56:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-11-26 02:56:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-11-26 02:56:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-11-26 02:56:27,861 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-11-26 02:56:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:27,861 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-11-26 02:56:27,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-11-26 02:56:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:56:27,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:27,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:27,873 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:27,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash 198508051, now seen corresponding path program 1 times [2019-11-26 02:56:27,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:27,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637593455] [2019-11-26 02:56:27,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:27,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637593455] [2019-11-26 02:56:27,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:27,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:27,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849351061] [2019-11-26 02:56:27,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:56:27,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:27,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:56:27,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:56:27,924 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-11-26 02:56:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:28,128 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-11-26 02:56:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:28,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-26 02:56:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:28,152 INFO L225 Difference]: With dead ends: 12704 [2019-11-26 02:56:28,152 INFO L226 Difference]: Without dead ends: 12704 [2019-11-26 02:56:28,152 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-11-26 02:56:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-11-26 02:56:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-11-26 02:56:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-11-26 02:56:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-11-26 02:56:28,379 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-11-26 02:56:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:28,379 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-11-26 02:56:28,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:56:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-11-26 02:56:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:28,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:28,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:28,395 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -898304257, now seen corresponding path program 1 times [2019-11-26 02:56:28,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:28,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436244976] [2019-11-26 02:56:28,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436244976] [2019-11-26 02:56:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:28,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719584757] [2019-11-26 02:56:28,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:28,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:28,549 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-11-26 02:56:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:29,098 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-11-26 02:56:29,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:56:29,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-26 02:56:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:29,116 INFO L225 Difference]: With dead ends: 13737 [2019-11-26 02:56:29,116 INFO L226 Difference]: Without dead ends: 13737 [2019-11-26 02:56:29,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-11-26 02:56:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-11-26 02:56:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-26 02:56:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-11-26 02:56:29,291 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-11-26 02:56:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:29,291 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-11-26 02:56:29,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-11-26 02:56:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:29,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:29,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:29,303 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1319453696, now seen corresponding path program 1 times [2019-11-26 02:56:29,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:29,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645913900] [2019-11-26 02:56:29,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:29,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645913900] [2019-11-26 02:56:29,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:29,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:29,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491412335] [2019-11-26 02:56:29,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:29,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:29,419 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-11-26 02:56:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:29,771 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-11-26 02:56:29,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:56:29,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-26 02:56:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:29,790 INFO L225 Difference]: With dead ends: 15574 [2019-11-26 02:56:29,790 INFO L226 Difference]: Without dead ends: 15574 [2019-11-26 02:56:29,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:56:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-11-26 02:56:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-11-26 02:56:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-11-26 02:56:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-11-26 02:56:29,978 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-11-26 02:56:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:29,978 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-11-26 02:56:29,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-11-26 02:56:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:30,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:30,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:30,104 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1530804609, now seen corresponding path program 1 times [2019-11-26 02:56:30,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:30,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609602045] [2019-11-26 02:56:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:30,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609602045] [2019-11-26 02:56:30,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:30,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:30,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724623834] [2019-11-26 02:56:30,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:56:30,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:56:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:30,170 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-11-26 02:56:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:30,474 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-11-26 02:56:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:56:30,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-26 02:56:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:30,494 INFO L225 Difference]: With dead ends: 17386 [2019-11-26 02:56:30,494 INFO L226 Difference]: Without dead ends: 17386 [2019-11-26 02:56:30,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:56:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-11-26 02:56:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-11-26 02:56:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-11-26 02:56:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-11-26 02:56:30,685 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-11-26 02:56:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:30,685 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-11-26 02:56:30,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:56:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-11-26 02:56:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:30,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:30,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:30,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1020270432, now seen corresponding path program 1 times [2019-11-26 02:56:30,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:30,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211352087] [2019-11-26 02:56:30,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:30,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211352087] [2019-11-26 02:56:30,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:30,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:30,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451967396] [2019-11-26 02:56:30,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:56:30,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:56:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:30,765 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-11-26 02:56:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:31,168 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-11-26 02:56:31,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:56:31,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-26 02:56:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:31,193 INFO L225 Difference]: With dead ends: 19768 [2019-11-26 02:56:31,193 INFO L226 Difference]: Without dead ends: 19768 [2019-11-26 02:56:31,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-11-26 02:56:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-11-26 02:56:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-11-26 02:56:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-11-26 02:56:31,420 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-11-26 02:56:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:31,420 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-11-26 02:56:31,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:56:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-11-26 02:56:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:31,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:31,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:56:31,430 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -787184031, now seen corresponding path program 1 times [2019-11-26 02:56:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:31,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370294723] [2019-11-26 02:56:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:31,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370294723] [2019-11-26 02:56:31,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:31,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:31,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769096964] [2019-11-26 02:56:31,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:31,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:31,488 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-11-26 02:56:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:31,872 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-11-26 02:56:31,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:56:31,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:56:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:31,899 INFO L225 Difference]: With dead ends: 20664 [2019-11-26 02:56:31,899 INFO L226 Difference]: Without dead ends: 20388 [2019-11-26 02:56:31,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-26 02:56:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-11-26 02:56:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-11-26 02:56:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-11-26 02:56:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-11-26 02:56:32,163 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-11-26 02:56:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:32,163 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-11-26 02:56:32,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-11-26 02:56:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:32,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:32,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:32,173 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1710831906, now seen corresponding path program 1 times [2019-11-26 02:56:32,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:32,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700524683] [2019-11-26 02:56:32,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:32,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700524683] [2019-11-26 02:56:32,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:32,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 02:56:32,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848972361] [2019-11-26 02:56:32,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:56:32,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:32,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:56:32,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:56:32,292 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-11-26 02:56:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:33,007 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-11-26 02:56:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:56:33,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-11-26 02:56:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:33,039 INFO L225 Difference]: With dead ends: 24278 [2019-11-26 02:56:33,039 INFO L226 Difference]: Without dead ends: 24278 [2019-11-26 02:56:33,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:56:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-11-26 02:56:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-11-26 02:56:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-11-26 02:56:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-11-26 02:56:33,332 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-11-26 02:56:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:33,332 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-11-26 02:56:33,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:56:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-11-26 02:56:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:33,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:33,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, 1, 1, 1, 1] [2019-11-26 02:56:33,342 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1696631709, now seen corresponding path program 1 times [2019-11-26 02:56:33,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:33,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847055168] [2019-11-26 02:56:33,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:33,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847055168] [2019-11-26 02:56:33,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:33,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:33,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467614698] [2019-11-26 02:56:33,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:56:33,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:56:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:33,423 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-11-26 02:56:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:33,465 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-11-26 02:56:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:56:33,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-26 02:56:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:33,469 INFO L225 Difference]: With dead ends: 6192 [2019-11-26 02:56:33,469 INFO L226 Difference]: Without dead ends: 5020 [2019-11-26 02:56:33,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-26 02:56:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-11-26 02:56:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-11-26 02:56:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-11-26 02:56:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-11-26 02:56:33,515 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-11-26 02:56:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:33,516 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-11-26 02:56:33,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:56:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-11-26 02:56:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:56:33,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:33,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:33,521 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:33,522 INFO L82 PathProgramCache]: Analyzing trace with hash -704066716, now seen corresponding path program 1 times [2019-11-26 02:56:33,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:33,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168233124] [2019-11-26 02:56:33,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:33,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168233124] [2019-11-26 02:56:33,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:33,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:33,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878575187] [2019-11-26 02:56:33,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:56:33,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:56:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:33,584 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 5 states. [2019-11-26 02:56:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:33,892 INFO L93 Difference]: Finished difference Result 4936 states and 11181 transitions. [2019-11-26 02:56:33,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:56:33,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-26 02:56:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:33,897 INFO L225 Difference]: With dead ends: 4936 [2019-11-26 02:56:33,898 INFO L226 Difference]: Without dead ends: 4905 [2019-11-26 02:56:33,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-11-26 02:56:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4420. [2019-11-26 02:56:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-11-26 02:56:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 10099 transitions. [2019-11-26 02:56:33,963 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 10099 transitions. Word has length 86 [2019-11-26 02:56:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:33,963 INFO L462 AbstractCegarLoop]: Abstraction has 4420 states and 10099 transitions. [2019-11-26 02:56:33,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:56:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 10099 transitions. [2019-11-26 02:56:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:56:33,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:33,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:56:33,968 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash 644532785, now seen corresponding path program 1 times [2019-11-26 02:56:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:33,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088655893] [2019-11-26 02:56:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:34,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088655893] [2019-11-26 02:56:34,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:34,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:56:34,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189489566] [2019-11-26 02:56:34,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:56:34,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:56:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:56:34,111 INFO L87 Difference]: Start difference. First operand 4420 states and 10099 transitions. Second operand 7 states. [2019-11-26 02:56:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:34,580 INFO L93 Difference]: Finished difference Result 5530 states and 12573 transitions. [2019-11-26 02:56:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:56:34,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-26 02:56:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:34,586 INFO L225 Difference]: With dead ends: 5530 [2019-11-26 02:56:34,586 INFO L226 Difference]: Without dead ends: 5512 [2019-11-26 02:56:34,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:56:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2019-11-26 02:56:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4565. [2019-11-26 02:56:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-26 02:56:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 10427 transitions. [2019-11-26 02:56:34,651 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 10427 transitions. Word has length 86 [2019-11-26 02:56:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:34,651 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 10427 transitions. [2019-11-26 02:56:34,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:56:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 10427 transitions. [2019-11-26 02:56:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:56:34,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:34,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:34,658 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1152418574, now seen corresponding path program 1 times [2019-11-26 02:56:34,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:34,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955136226] [2019-11-26 02:56:34,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:34,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955136226] [2019-11-26 02:56:34,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:34,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:34,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181158167] [2019-11-26 02:56:34,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:34,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:34,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:34,768 INFO L87 Difference]: Start difference. First operand 4565 states and 10427 transitions. Second operand 6 states. [2019-11-26 02:56:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:34,990 INFO L93 Difference]: Finished difference Result 4403 states and 9941 transitions. [2019-11-26 02:56:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:56:34,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-26 02:56:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:34,995 INFO L225 Difference]: With dead ends: 4403 [2019-11-26 02:56:34,996 INFO L226 Difference]: Without dead ends: 4403 [2019-11-26 02:56:34,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2019-11-26 02:56:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3069. [2019-11-26 02:56:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2019-11-26 02:56:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 7023 transitions. [2019-11-26 02:56:35,046 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 7023 transitions. Word has length 86 [2019-11-26 02:56:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:35,047 INFO L462 AbstractCegarLoop]: Abstraction has 3069 states and 7023 transitions. [2019-11-26 02:56:35,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 7023 transitions. [2019-11-26 02:56:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:56:35,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:35,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:35,051 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1161956523, now seen corresponding path program 1 times [2019-11-26 02:56:35,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:35,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318924023] [2019-11-26 02:56:35,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:35,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318924023] [2019-11-26 02:56:35,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:35,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 02:56:35,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910813802] [2019-11-26 02:56:35,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:56:35,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:56:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:35,235 INFO L87 Difference]: Start difference. First operand 3069 states and 7023 transitions. Second operand 8 states. [2019-11-26 02:56:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:35,544 INFO L93 Difference]: Finished difference Result 3569 states and 8090 transitions. [2019-11-26 02:56:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:56:35,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-26 02:56:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:35,547 INFO L225 Difference]: With dead ends: 3569 [2019-11-26 02:56:35,548 INFO L226 Difference]: Without dead ends: 3569 [2019-11-26 02:56:35,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:56:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2019-11-26 02:56:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3168. [2019-11-26 02:56:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-26 02:56:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7228 transitions. [2019-11-26 02:56:35,592 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7228 transitions. Word has length 88 [2019-11-26 02:56:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:35,592 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7228 transitions. [2019-11-26 02:56:35,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:56:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7228 transitions. [2019-11-26 02:56:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:56:35,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:35,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:35,596 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2049460204, now seen corresponding path program 1 times [2019-11-26 02:56:35,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:35,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666655025] [2019-11-26 02:56:35,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:35,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666655025] [2019-11-26 02:56:35,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:35,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:56:35,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480827512] [2019-11-26 02:56:35,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:56:35,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:35,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:56:35,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:56:35,713 INFO L87 Difference]: Start difference. First operand 3168 states and 7228 transitions. Second operand 7 states. [2019-11-26 02:56:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:35,826 INFO L93 Difference]: Finished difference Result 5381 states and 12355 transitions. [2019-11-26 02:56:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:56:35,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-11-26 02:56:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:35,829 INFO L225 Difference]: With dead ends: 5381 [2019-11-26 02:56:35,829 INFO L226 Difference]: Without dead ends: 2305 [2019-11-26 02:56:35,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:56:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-11-26 02:56:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-11-26 02:56:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-11-26 02:56:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5276 transitions. [2019-11-26 02:56:35,858 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5276 transitions. Word has length 88 [2019-11-26 02:56:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:35,858 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5276 transitions. [2019-11-26 02:56:35,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:56:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5276 transitions. [2019-11-26 02:56:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:56:35,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:35,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:35,861 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash 502510154, now seen corresponding path program 2 times [2019-11-26 02:56:35,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:35,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337872165] [2019-11-26 02:56:35,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:56:36,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337872165] [2019-11-26 02:56:36,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:36,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 02:56:36,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432860608] [2019-11-26 02:56:36,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:56:36,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:56:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:56:36,070 INFO L87 Difference]: Start difference. First operand 2305 states and 5276 transitions. Second operand 10 states. [2019-11-26 02:56:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:36,333 INFO L93 Difference]: Finished difference Result 3951 states and 9033 transitions. [2019-11-26 02:56:36,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:56:36,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-26 02:56:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:36,335 INFO L225 Difference]: With dead ends: 3951 [2019-11-26 02:56:36,336 INFO L226 Difference]: Without dead ends: 2572 [2019-11-26 02:56:36,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:56:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-26 02:56:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2342. [2019-11-26 02:56:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2019-11-26 02:56:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 5307 transitions. [2019-11-26 02:56:36,357 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 5307 transitions. Word has length 88 [2019-11-26 02:56:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:36,357 INFO L462 AbstractCegarLoop]: Abstraction has 2342 states and 5307 transitions. [2019-11-26 02:56:36,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:56:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 5307 transitions. [2019-11-26 02:56:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:56:36,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:36,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:36,359 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1568953738, now seen corresponding path program 3 times [2019-11-26 02:56:36,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:36,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375298848] [2019-11-26 02:56:36,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:56:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:56:36,434 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:56:36,435 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:56:36,585 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-26 02:56:36,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:56:36 BasicIcfg [2019-11-26 02:56:36,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:56:36,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:56:36,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:56:36,588 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:56:36,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:09" (3/4) ... [2019-11-26 02:56:36,590 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:56:36,755 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c6e0d06e-67a3-4d33-8107-486d1fa75dea/bin/utaipan/witness.graphml [2019-11-26 02:56:36,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:56:36,758 INFO L168 Benchmark]: Toolchain (without parser) took 28618.08 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 940.7 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 389.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:36,758 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:56:36,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:36,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:36,759 INFO L168 Benchmark]: Boogie Preprocessor took 35.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:56:36,759 INFO L168 Benchmark]: RCFGBuilder took 638.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:36,760 INFO L168 Benchmark]: TraceAbstraction took 27091.99 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 309.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:36,760 INFO L168 Benchmark]: Witness Printer took 168.15 ms. Allocated memory is still 3.1 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:36,763 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 630.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 638.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27091.99 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 309.4 MB. Max. memory is 11.5 GB. * Witness Printer took 168.15 ms. Allocated memory is still 3.1 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 331 locations, 5 error locations. Result: UNSAFE, OverallTime: 26.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6650 SDtfs, 7264 SDslu, 15474 SDs, 0 SdLazy, 5933 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 50848 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1803 NumberOfCodeBlocks, 1803 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1690 ConstructedInterpolants, 0 QuantifiedInterpolants, 311584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...