./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/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 955a7462776db711df9d88fc8b0a22926f6ecdd0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-03 06:22:33,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:22:33,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:22:33,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:22:33,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:22:33,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:22:33,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:22:33,140 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:22:33,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:22:33,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:22:33,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:22:33,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:22:33,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:22:33,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:22:33,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:22:33,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:22:33,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:22:33,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:22:33,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:22:33,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:22:33,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:22:33,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:22:33,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:22:33,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:22:33,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:22:33,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:22:33,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:22:33,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:22:33,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:22:33,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:22:33,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:22:33,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:22:33,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:22:33,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:22:33,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:22:33,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:22:33,155 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 06:22:33,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:22:33,162 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:22:33,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:22:33,162 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:22:33,163 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:22:33,163 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:22:33,164 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:22:33,164 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 06:22:33,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:22:33,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:22:33,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:22:33,166 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 06:22:33,166 INFO L133 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/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/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 -> 955a7462776db711df9d88fc8b0a22926f6ecdd0 [2018-12-03 06:22:33,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:22:33,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:22:33,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:22:33,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:22:33,196 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:22:33,196 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i [2018-12-03 06:22:33,241 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/data/77537cf90/806ddcaea8e748139f498ec8356faf16/FLAGb086328c6 [2018-12-03 06:22:33,663 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:22:33,664 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/sv-benchmarks/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i [2018-12-03 06:22:33,671 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/data/77537cf90/806ddcaea8e748139f498ec8356faf16/FLAGb086328c6 [2018-12-03 06:22:33,680 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/data/77537cf90/806ddcaea8e748139f498ec8356faf16 [2018-12-03 06:22:33,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:22:33,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:22:33,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:22:33,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:22:33,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:22:33,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:22:33" (1/1) ... [2018-12-03 06:22:33,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:33, skipping insertion in model container [2018-12-03 06:22:33,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:22:33" (1/1) ... [2018-12-03 06:22:33,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:22:33,713 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:22:33,886 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:22:33,932 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:22:33,983 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:22:34,032 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:22:34,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34 WrapperNode [2018-12-03 06:22:34,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:22:34,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:22:34,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:22:34,034 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:22:34,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:22:34,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:22:34,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:22:34,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:22:34,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... [2018-12-03 06:22:34,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:22:34,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:22:34,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:22:34,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:22:34,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/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 [2018-12-03 06:22:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:22:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 06:22:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 06:22:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:22:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 06:22:34,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 06:22:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 06:22:34,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 06:22:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 06:22:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:22:34,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:22:34,138 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 06:22:34,460 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:22:34,460 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 06:22:34,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:22:34 BoogieIcfgContainer [2018-12-03 06:22:34,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:22:34,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:22:34,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:22:34,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:22:34,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:22:33" (1/3) ... [2018-12-03 06:22:34,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360d5a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:22:34, skipping insertion in model container [2018-12-03 06:22:34,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:22:34" (2/3) ... [2018-12-03 06:22:34,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360d5a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:22:34, skipping insertion in model container [2018-12-03 06:22:34,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:22:34" (3/3) ... [2018-12-03 06:22:34,465 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt_false-unreach-call.i [2018-12-03 06:22:34,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,485 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,485 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:22:34,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 06:22:34,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:22:34,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 06:22:34,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 06:22:34,524 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:22:34,524 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 06:22:34,524 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:22:34,524 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:22:34,524 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:22:34,524 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:22:34,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:22:34,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:22:34,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 06:22:35,344 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-03 06:22:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-03 06:22:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 06:22:35,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:35,351 INFO L402 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] [2018-12-03 06:22:35,352 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:35,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-03 06:22:35,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:35,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:35,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:35,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:22:35,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:35,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:22:35,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:22:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:22:35,520 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-03 06:22:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:35,893 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-03 06:22:35,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:22:35,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-03 06:22:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:36,029 INFO L225 Difference]: With dead ends: 45389 [2018-12-03 06:22:36,030 INFO L226 Difference]: Without dead ends: 40629 [2018-12-03 06:22:36,031 INFO L631 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 [2018-12-03 06:22:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-03 06:22:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-03 06:22:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 06:22:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-03 06:22:36,718 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-03 06:22:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:36,719 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-03 06:22:36,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:22:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-03 06:22:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 06:22:36,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:36,721 INFO L402 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] [2018-12-03 06:22:36,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:36,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-03 06:22:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:36,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:36,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:36,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:36,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:22:36,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:36,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:22:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:22:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:22:36,763 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-03 06:22:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:36,888 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-03 06:22:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:22:36,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 06:22:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:37,029 INFO L225 Difference]: With dead ends: 23663 [2018-12-03 06:22:37,029 INFO L226 Difference]: Without dead ends: 23663 [2018-12-03 06:22:37,030 INFO L631 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 [2018-12-03 06:22:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-03 06:22:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-03 06:22:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 06:22:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-03 06:22:37,362 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-03 06:22:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:37,362 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-03 06:22:37,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:22:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-03 06:22:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 06:22:37,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:37,363 INFO L402 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] [2018-12-03 06:22:37,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:37,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1341601382, now seen corresponding path program 1 times [2018-12-03 06:22:37,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:37,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:37,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:22:37,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:37,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:22:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:22:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:22:37,407 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-03 06:22:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:37,954 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-03 06:22:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:22:37,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 06:22:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:38,079 INFO L225 Difference]: With dead ends: 64831 [2018-12-03 06:22:38,080 INFO L226 Difference]: Without dead ends: 64671 [2018-12-03 06:22:38,080 INFO L631 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 [2018-12-03 06:22:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-03 06:22:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-03 06:22:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 06:22:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-03 06:22:38,841 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-03 06:22:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:38,842 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-03 06:22:38,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:22:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-03 06:22:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:22:38,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:38,844 INFO L402 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] [2018-12-03 06:22:38,844 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:38,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-03 06:22:38,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:38,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:38,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:38,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:38,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:22:38,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:38,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:22:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:22:38,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:22:38,901 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2018-12-03 06:22:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:39,293 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2018-12-03 06:22:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:22:39,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 06:22:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:39,408 INFO L225 Difference]: With dead ends: 66627 [2018-12-03 06:22:39,409 INFO L226 Difference]: Without dead ends: 66459 [2018-12-03 06:22:39,409 INFO L631 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 [2018-12-03 06:22:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-03 06:22:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-03 06:22:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-03 06:22:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2018-12-03 06:22:40,187 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2018-12-03 06:22:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:40,187 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2018-12-03 06:22:40,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:22:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2018-12-03 06:22:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:22:40,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:40,193 INFO L402 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] [2018-12-03 06:22:40,193 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:40,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1765825254, now seen corresponding path program 1 times [2018-12-03 06:22:40,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:40,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:40,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:40,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:40,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:22:40,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:40,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:22:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:22:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:22:40,227 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 3 states. [2018-12-03 06:22:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:40,366 INFO L93 Difference]: Finished difference Result 38835 states and 143586 transitions. [2018-12-03 06:22:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:22:40,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-03 06:22:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:40,428 INFO L225 Difference]: With dead ends: 38835 [2018-12-03 06:22:40,429 INFO L226 Difference]: Without dead ends: 38835 [2018-12-03 06:22:40,429 INFO L631 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 [2018-12-03 06:22:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38835 states. [2018-12-03 06:22:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38835 to 38835. [2018-12-03 06:22:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-03 06:22:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143586 transitions. [2018-12-03 06:22:41,016 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143586 transitions. Word has length 53 [2018-12-03 06:22:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:41,016 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143586 transitions. [2018-12-03 06:22:41,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:22:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143586 transitions. [2018-12-03 06:22:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:22:41,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:41,022 INFO L402 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] [2018-12-03 06:22:41,022 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:41,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash -23014919, now seen corresponding path program 1 times [2018-12-03 06:22:41,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:41,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:41,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:41,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:22:41,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:41,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:22:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:22:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:22:41,078 INFO L87 Difference]: Start difference. First operand 38835 states and 143586 transitions. Second operand 6 states. [2018-12-03 06:22:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:41,633 INFO L93 Difference]: Finished difference Result 68209 states and 246407 transitions. [2018-12-03 06:22:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:22:41,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 06:22:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:41,749 INFO L225 Difference]: With dead ends: 68209 [2018-12-03 06:22:41,749 INFO L226 Difference]: Without dead ends: 68049 [2018-12-03 06:22:41,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-03 06:22:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68049 states. [2018-12-03 06:22:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68049 to 37685. [2018-12-03 06:22:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37685 states. [2018-12-03 06:22:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37685 states to 37685 states and 139346 transitions. [2018-12-03 06:22:42,571 INFO L78 Accepts]: Start accepts. Automaton has 37685 states and 139346 transitions. Word has length 53 [2018-12-03 06:22:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:42,571 INFO L480 AbstractCegarLoop]: Abstraction has 37685 states and 139346 transitions. [2018-12-03 06:22:42,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:22:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 37685 states and 139346 transitions. [2018-12-03 06:22:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 06:22:42,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:42,582 INFO L402 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] [2018-12-03 06:22:42,583 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:42,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:42,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1558641035, now seen corresponding path program 1 times [2018-12-03 06:22:42,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:42,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:42,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:42,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:22:42,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:42,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:22:42,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:22:42,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:22:42,619 INFO L87 Difference]: Start difference. First operand 37685 states and 139346 transitions. Second operand 4 states. [2018-12-03 06:22:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:43,047 INFO L93 Difference]: Finished difference Result 60336 states and 220007 transitions. [2018-12-03 06:22:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:22:43,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-03 06:22:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:43,156 INFO L225 Difference]: With dead ends: 60336 [2018-12-03 06:22:43,156 INFO L226 Difference]: Without dead ends: 60040 [2018-12-03 06:22:43,157 INFO L631 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 [2018-12-03 06:22:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60040 states. [2018-12-03 06:22:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60040 to 50355. [2018-12-03 06:22:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50355 states. [2018-12-03 06:22:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50355 states to 50355 states and 185679 transitions. [2018-12-03 06:22:43,982 INFO L78 Accepts]: Start accepts. Automaton has 50355 states and 185679 transitions. Word has length 60 [2018-12-03 06:22:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:43,983 INFO L480 AbstractCegarLoop]: Abstraction has 50355 states and 185679 transitions. [2018-12-03 06:22:43,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:22:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50355 states and 185679 transitions. [2018-12-03 06:22:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 06:22:44,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:44,001 INFO L402 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] [2018-12-03 06:22:44,001 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash -205331338, now seen corresponding path program 1 times [2018-12-03 06:22:44,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:44,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:44,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:44,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:44,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:22:44,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:44,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:22:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:22:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:22:44,058 INFO L87 Difference]: Start difference. First operand 50355 states and 185679 transitions. Second operand 6 states. [2018-12-03 06:22:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:44,709 INFO L93 Difference]: Finished difference Result 100691 states and 366187 transitions. [2018-12-03 06:22:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:22:44,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-03 06:22:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:44,900 INFO L225 Difference]: With dead ends: 100691 [2018-12-03 06:22:44,900 INFO L226 Difference]: Without dead ends: 100435 [2018-12-03 06:22:44,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:22:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100435 states. [2018-12-03 06:22:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100435 to 57720. [2018-12-03 06:22:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57720 states. [2018-12-03 06:22:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57720 states to 57720 states and 210955 transitions. [2018-12-03 06:22:45,999 INFO L78 Accepts]: Start accepts. Automaton has 57720 states and 210955 transitions. Word has length 60 [2018-12-03 06:22:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:45,999 INFO L480 AbstractCegarLoop]: Abstraction has 57720 states and 210955 transitions. [2018-12-03 06:22:45,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:22:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57720 states and 210955 transitions. [2018-12-03 06:22:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 06:22:46,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:46,023 INFO L402 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] [2018-12-03 06:22:46,023 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:46,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1421005029, now seen corresponding path program 1 times [2018-12-03 06:22:46,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:46,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:46,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:46,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:46,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:22:46,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:46,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:22:46,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:22:46,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:22:46,042 INFO L87 Difference]: Start difference. First operand 57720 states and 210955 transitions. Second operand 3 states. [2018-12-03 06:22:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:46,277 INFO L93 Difference]: Finished difference Result 70578 states and 254301 transitions. [2018-12-03 06:22:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:22:46,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-03 06:22:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:46,387 INFO L225 Difference]: With dead ends: 70578 [2018-12-03 06:22:46,387 INFO L226 Difference]: Without dead ends: 70578 [2018-12-03 06:22:46,387 INFO L631 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 [2018-12-03 06:22:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70578 states. [2018-12-03 06:22:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70578 to 61855. [2018-12-03 06:22:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61855 states. [2018-12-03 06:22:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61855 states to 61855 states and 225033 transitions. [2018-12-03 06:22:47,363 INFO L78 Accepts]: Start accepts. Automaton has 61855 states and 225033 transitions. Word has length 62 [2018-12-03 06:22:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 61855 states and 225033 transitions. [2018-12-03 06:22:47,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:22:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 61855 states and 225033 transitions. [2018-12-03 06:22:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 06:22:47,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:47,396 INFO L402 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] [2018-12-03 06:22:47,396 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:47,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1661814372, now seen corresponding path program 1 times [2018-12-03 06:22:47,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:47,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:47,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:47,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:47,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:22:47,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:47,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:22:47,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:22:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:22:47,441 INFO L87 Difference]: Start difference. First operand 61855 states and 225033 transitions. Second operand 7 states. [2018-12-03 06:22:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:48,231 INFO L93 Difference]: Finished difference Result 108957 states and 390675 transitions. [2018-12-03 06:22:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:22:48,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 06:22:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:48,432 INFO L225 Difference]: With dead ends: 108957 [2018-12-03 06:22:48,432 INFO L226 Difference]: Without dead ends: 108701 [2018-12-03 06:22:48,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-03 06:22:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108701 states. [2018-12-03 06:22:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108701 to 63367. [2018-12-03 06:22:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63367 states. [2018-12-03 06:22:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63367 states to 63367 states and 230197 transitions. [2018-12-03 06:22:49,687 INFO L78 Accepts]: Start accepts. Automaton has 63367 states and 230197 transitions. Word has length 66 [2018-12-03 06:22:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:49,688 INFO L480 AbstractCegarLoop]: Abstraction has 63367 states and 230197 transitions. [2018-12-03 06:22:49,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:22:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 63367 states and 230197 transitions. [2018-12-03 06:22:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:22:49,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:49,719 INFO L402 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] [2018-12-03 06:22:49,719 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:49,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash -618382876, now seen corresponding path program 1 times [2018-12-03 06:22:49,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:49,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:49,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:49,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:49,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:49,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:49,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:22:49,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:49,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:22:49,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:22:49,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:22:49,797 INFO L87 Difference]: Start difference. First operand 63367 states and 230197 transitions. Second operand 5 states. [2018-12-03 06:22:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:50,351 INFO L93 Difference]: Finished difference Result 101266 states and 362936 transitions. [2018-12-03 06:22:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:22:50,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 06:22:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:50,541 INFO L225 Difference]: With dead ends: 101266 [2018-12-03 06:22:50,541 INFO L226 Difference]: Without dead ends: 101010 [2018-12-03 06:22:50,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:22:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101010 states. [2018-12-03 06:22:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101010 to 90651. [2018-12-03 06:22:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90651 states. [2018-12-03 06:22:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90651 states to 90651 states and 327218 transitions. [2018-12-03 06:22:51,961 INFO L78 Accepts]: Start accepts. Automaton has 90651 states and 327218 transitions. Word has length 67 [2018-12-03 06:22:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:51,961 INFO L480 AbstractCegarLoop]: Abstraction has 90651 states and 327218 transitions. [2018-12-03 06:22:51,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:22:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 90651 states and 327218 transitions. [2018-12-03 06:22:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:22:52,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:52,218 INFO L402 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] [2018-12-03 06:22:52,219 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:52,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -911785883, now seen corresponding path program 1 times [2018-12-03 06:22:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:52,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:52,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:52,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:22:52,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:52,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:22:52,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:22:52,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:22:52,258 INFO L87 Difference]: Start difference. First operand 90651 states and 327218 transitions. Second operand 7 states. [2018-12-03 06:22:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:53,127 INFO L93 Difference]: Finished difference Result 118588 states and 425014 transitions. [2018-12-03 06:22:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:22:53,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-03 06:22:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:53,347 INFO L225 Difference]: With dead ends: 118588 [2018-12-03 06:22:53,347 INFO L226 Difference]: Without dead ends: 118372 [2018-12-03 06:22:53,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-03 06:22:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118372 states. [2018-12-03 06:22:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118372 to 91420. [2018-12-03 06:22:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91420 states. [2018-12-03 06:22:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91420 states to 91420 states and 329711 transitions. [2018-12-03 06:22:54,902 INFO L78 Accepts]: Start accepts. Automaton has 91420 states and 329711 transitions. Word has length 67 [2018-12-03 06:22:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:54,902 INFO L480 AbstractCegarLoop]: Abstraction has 91420 states and 329711 transitions. [2018-12-03 06:22:54,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:22:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 91420 states and 329711 transitions. [2018-12-03 06:22:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 06:22:54,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:54,967 INFO L402 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] [2018-12-03 06:22:54,967 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:54,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash -140132620, now seen corresponding path program 1 times [2018-12-03 06:22:54,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:54,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:54,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:54,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:55,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:55,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:22:55,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:55,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:22:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:22:55,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:22:55,024 INFO L87 Difference]: Start difference. First operand 91420 states and 329711 transitions. Second operand 6 states. [2018-12-03 06:22:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:55,761 INFO L93 Difference]: Finished difference Result 108145 states and 386365 transitions. [2018-12-03 06:22:55,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:22:55,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 06:22:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:55,948 INFO L225 Difference]: With dead ends: 108145 [2018-12-03 06:22:55,948 INFO L226 Difference]: Without dead ends: 106947 [2018-12-03 06:22:55,949 INFO L631 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 [2018-12-03 06:22:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106947 states. [2018-12-03 06:22:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106947 to 90444. [2018-12-03 06:22:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90444 states. [2018-12-03 06:22:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90444 states to 90444 states and 326340 transitions. [2018-12-03 06:22:57,310 INFO L78 Accepts]: Start accepts. Automaton has 90444 states and 326340 transitions. Word has length 69 [2018-12-03 06:22:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:22:57,310 INFO L480 AbstractCegarLoop]: Abstraction has 90444 states and 326340 transitions. [2018-12-03 06:22:57,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:22:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 90444 states and 326340 transitions. [2018-12-03 06:22:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 06:22:57,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:22:57,374 INFO L402 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] [2018-12-03 06:22:57,374 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:22:57,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:22:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash -423283084, now seen corresponding path program 1 times [2018-12-03 06:22:57,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:22:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:57,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:22:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:22:57,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:22:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:22:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:22:57,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:22:57,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:22:57,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:22:57,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:22:57,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:22:57,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:22:57,432 INFO L87 Difference]: Start difference. First operand 90444 states and 326340 transitions. Second operand 7 states. [2018-12-03 06:22:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:22:58,286 INFO L93 Difference]: Finished difference Result 120574 states and 424898 transitions. [2018-12-03 06:22:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:22:58,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-03 06:22:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:22:58,505 INFO L225 Difference]: With dead ends: 120574 [2018-12-03 06:22:58,505 INFO L226 Difference]: Without dead ends: 120574 [2018-12-03 06:22:58,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:22:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120574 states. [2018-12-03 06:23:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120574 to 111084. [2018-12-03 06:23:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111084 states. [2018-12-03 06:23:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111084 states to 111084 states and 394692 transitions. [2018-12-03 06:23:00,518 INFO L78 Accepts]: Start accepts. Automaton has 111084 states and 394692 transitions. Word has length 69 [2018-12-03 06:23:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:00,519 INFO L480 AbstractCegarLoop]: Abstraction has 111084 states and 394692 transitions. [2018-12-03 06:23:00,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:23:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 111084 states and 394692 transitions. [2018-12-03 06:23:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 06:23:00,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:00,596 INFO L402 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] [2018-12-03 06:23:00,597 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:00,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash 821481397, now seen corresponding path program 1 times [2018-12-03 06:23:00,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:00,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:00,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:00,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:00,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:00,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:00,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:23:00,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:00,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:23:00,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:23:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:23:00,629 INFO L87 Difference]: Start difference. First operand 111084 states and 394692 transitions. Second operand 4 states. [2018-12-03 06:23:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:00,735 INFO L93 Difference]: Finished difference Result 35081 states and 113191 transitions. [2018-12-03 06:23:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:23:00,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-03 06:23:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:00,784 INFO L225 Difference]: With dead ends: 35081 [2018-12-03 06:23:00,784 INFO L226 Difference]: Without dead ends: 34540 [2018-12-03 06:23:00,784 INFO L631 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 [2018-12-03 06:23:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34540 states. [2018-12-03 06:23:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34540 to 34528. [2018-12-03 06:23:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34528 states. [2018-12-03 06:23:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34528 states to 34528 states and 111547 transitions. [2018-12-03 06:23:01,158 INFO L78 Accepts]: Start accepts. Automaton has 34528 states and 111547 transitions. Word has length 69 [2018-12-03 06:23:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:01,158 INFO L480 AbstractCegarLoop]: Abstraction has 34528 states and 111547 transitions. [2018-12-03 06:23:01,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:23:01,158 INFO L276 IsEmpty]: Start isEmpty. Operand 34528 states and 111547 transitions. [2018-12-03 06:23:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 06:23:01,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:01,179 INFO L402 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] [2018-12-03 06:23:01,180 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:01,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1605948861, now seen corresponding path program 1 times [2018-12-03 06:23:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:01,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:01,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:01,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:01,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:23:01,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:01,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:23:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:23:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:23:01,244 INFO L87 Difference]: Start difference. First operand 34528 states and 111547 transitions. Second operand 8 states. [2018-12-03 06:23:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:01,886 INFO L93 Difference]: Finished difference Result 37868 states and 121548 transitions. [2018-12-03 06:23:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 06:23:01,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-03 06:23:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:01,949 INFO L225 Difference]: With dead ends: 37868 [2018-12-03 06:23:01,949 INFO L226 Difference]: Without dead ends: 37804 [2018-12-03 06:23:01,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-03 06:23:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37804 states. [2018-12-03 06:23:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37804 to 29484. [2018-12-03 06:23:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29484 states. [2018-12-03 06:23:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29484 states to 29484 states and 96024 transitions. [2018-12-03 06:23:02,310 INFO L78 Accepts]: Start accepts. Automaton has 29484 states and 96024 transitions. Word has length 79 [2018-12-03 06:23:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:02,310 INFO L480 AbstractCegarLoop]: Abstraction has 29484 states and 96024 transitions. [2018-12-03 06:23:02,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:23:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29484 states and 96024 transitions. [2018-12-03 06:23:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 06:23:02,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:02,330 INFO L402 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] [2018-12-03 06:23:02,331 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:02,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 509727806, now seen corresponding path program 1 times [2018-12-03 06:23:02,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:02,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:02,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:02,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:23:02,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:02,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:23:02,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:23:02,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:23:02,355 INFO L87 Difference]: Start difference. First operand 29484 states and 96024 transitions. Second operand 3 states. [2018-12-03 06:23:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:02,541 INFO L93 Difference]: Finished difference Result 31936 states and 103482 transitions. [2018-12-03 06:23:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:23:02,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 06:23:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:02,579 INFO L225 Difference]: With dead ends: 31936 [2018-12-03 06:23:02,579 INFO L226 Difference]: Without dead ends: 31936 [2018-12-03 06:23:02,580 INFO L631 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 [2018-12-03 06:23:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31936 states. [2018-12-03 06:23:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31936 to 30704. [2018-12-03 06:23:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30704 states. [2018-12-03 06:23:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30704 states to 30704 states and 99736 transitions. [2018-12-03 06:23:02,916 INFO L78 Accepts]: Start accepts. Automaton has 30704 states and 99736 transitions. Word has length 80 [2018-12-03 06:23:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:02,916 INFO L480 AbstractCegarLoop]: Abstraction has 30704 states and 99736 transitions. [2018-12-03 06:23:02,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:23:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30704 states and 99736 transitions. [2018-12-03 06:23:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 06:23:02,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:02,937 INFO L402 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] [2018-12-03 06:23:02,937 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:02,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash 723145821, now seen corresponding path program 1 times [2018-12-03 06:23:02,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:02,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:02,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:02,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:02,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:23:02,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:02,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:23:02,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:23:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:23:02,972 INFO L87 Difference]: Start difference. First operand 30704 states and 99736 transitions. Second operand 4 states. [2018-12-03 06:23:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:03,184 INFO L93 Difference]: Finished difference Result 36586 states and 117203 transitions. [2018-12-03 06:23:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:23:03,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 06:23:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:03,231 INFO L225 Difference]: With dead ends: 36586 [2018-12-03 06:23:03,231 INFO L226 Difference]: Without dead ends: 36410 [2018-12-03 06:23:03,231 INFO L631 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 [2018-12-03 06:23:03,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36410 states. [2018-12-03 06:23:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36410 to 34718. [2018-12-03 06:23:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34718 states. [2018-12-03 06:23:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34718 states to 34718 states and 111870 transitions. [2018-12-03 06:23:03,625 INFO L78 Accepts]: Start accepts. Automaton has 34718 states and 111870 transitions. Word has length 81 [2018-12-03 06:23:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:03,625 INFO L480 AbstractCegarLoop]: Abstraction has 34718 states and 111870 transitions. [2018-12-03 06:23:03,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:23:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 34718 states and 111870 transitions. [2018-12-03 06:23:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 06:23:03,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:03,652 INFO L402 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] [2018-12-03 06:23:03,652 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:03,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1212514466, now seen corresponding path program 1 times [2018-12-03 06:23:03,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:03,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:03,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:03,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:03,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:03,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:03,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:23:03,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:03,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:23:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:23:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:23:03,688 INFO L87 Difference]: Start difference. First operand 34718 states and 111870 transitions. Second operand 3 states. [2018-12-03 06:23:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:03,891 INFO L93 Difference]: Finished difference Result 37212 states and 119443 transitions. [2018-12-03 06:23:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:23:03,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-03 06:23:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:03,942 INFO L225 Difference]: With dead ends: 37212 [2018-12-03 06:23:03,942 INFO L226 Difference]: Without dead ends: 37212 [2018-12-03 06:23:03,942 INFO L631 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 [2018-12-03 06:23:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37212 states. [2018-12-03 06:23:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37212 to 35974. [2018-12-03 06:23:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2018-12-03 06:23:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 115678 transitions. [2018-12-03 06:23:04,352 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 115678 transitions. Word has length 81 [2018-12-03 06:23:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:04,352 INFO L480 AbstractCegarLoop]: Abstraction has 35974 states and 115678 transitions. [2018-12-03 06:23:04,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:23:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 115678 transitions. [2018-12-03 06:23:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:04,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:04,378 INFO L402 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] [2018-12-03 06:23:04,378 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:04,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1773086822, now seen corresponding path program 1 times [2018-12-03 06:23:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:04,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:04,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:04,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:04,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:23:04,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:04,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:23:04,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:23:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:23:04,548 INFO L87 Difference]: Start difference. First operand 35974 states and 115678 transitions. Second operand 6 states. [2018-12-03 06:23:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:05,047 INFO L93 Difference]: Finished difference Result 53376 states and 167986 transitions. [2018-12-03 06:23:05,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:23:05,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-03 06:23:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:05,129 INFO L225 Difference]: With dead ends: 53376 [2018-12-03 06:23:05,130 INFO L226 Difference]: Without dead ends: 52716 [2018-12-03 06:23:05,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:23:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52716 states. [2018-12-03 06:23:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52716 to 40300. [2018-12-03 06:23:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2018-12-03 06:23:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 129407 transitions. [2018-12-03 06:23:05,646 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 129407 transitions. Word has length 82 [2018-12-03 06:23:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:05,646 INFO L480 AbstractCegarLoop]: Abstraction has 40300 states and 129407 transitions. [2018-12-03 06:23:05,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:23:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 129407 transitions. [2018-12-03 06:23:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:05,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:05,676 INFO L402 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] [2018-12-03 06:23:05,676 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:05,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:05,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1489936358, now seen corresponding path program 1 times [2018-12-03 06:23:05,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:05,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:05,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:05,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:05,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:23:05,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:05,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:23:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:23:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:05,719 INFO L87 Difference]: Start difference. First operand 40300 states and 129407 transitions. Second operand 7 states. [2018-12-03 06:23:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:06,517 INFO L93 Difference]: Finished difference Result 65896 states and 204960 transitions. [2018-12-03 06:23:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 06:23:06,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-03 06:23:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:06,602 INFO L225 Difference]: With dead ends: 65896 [2018-12-03 06:23:06,602 INFO L226 Difference]: Without dead ends: 65784 [2018-12-03 06:23:06,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-03 06:23:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65784 states. [2018-12-03 06:23:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65784 to 42525. [2018-12-03 06:23:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2018-12-03 06:23:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 134449 transitions. [2018-12-03 06:23:07,210 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 134449 transitions. Word has length 82 [2018-12-03 06:23:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:07,211 INFO L480 AbstractCegarLoop]: Abstraction has 42525 states and 134449 transitions. [2018-12-03 06:23:07,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:23:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 134449 transitions. [2018-12-03 06:23:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:07,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:07,242 INFO L402 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] [2018-12-03 06:23:07,242 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:07,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1230500696, now seen corresponding path program 1 times [2018-12-03 06:23:07,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:07,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:07,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:07,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:07,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:07,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:07,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:23:07,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:07,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:23:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:23:07,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:07,289 INFO L87 Difference]: Start difference. First operand 42525 states and 134449 transitions. Second operand 7 states. [2018-12-03 06:23:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:07,881 INFO L93 Difference]: Finished difference Result 79413 states and 247508 transitions. [2018-12-03 06:23:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:23:07,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-03 06:23:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:07,986 INFO L225 Difference]: With dead ends: 79413 [2018-12-03 06:23:07,986 INFO L226 Difference]: Without dead ends: 78477 [2018-12-03 06:23:07,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:23:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78477 states. [2018-12-03 06:23:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78477 to 45874. [2018-12-03 06:23:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45874 states. [2018-12-03 06:23:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45874 states to 45874 states and 144580 transitions. [2018-12-03 06:23:08,660 INFO L78 Accepts]: Start accepts. Automaton has 45874 states and 144580 transitions. Word has length 82 [2018-12-03 06:23:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:08,660 INFO L480 AbstractCegarLoop]: Abstraction has 45874 states and 144580 transitions. [2018-12-03 06:23:08,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:23:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 45874 states and 144580 transitions. [2018-12-03 06:23:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:08,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:08,693 INFO L402 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] [2018-12-03 06:23:08,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:08,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1180169000, now seen corresponding path program 1 times [2018-12-03 06:23:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:08,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:23:08,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:08,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:23:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:23:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:23:08,756 INFO L87 Difference]: Start difference. First operand 45874 states and 144580 transitions. Second operand 8 states. [2018-12-03 06:23:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:09,787 INFO L93 Difference]: Finished difference Result 68189 states and 208948 transitions. [2018-12-03 06:23:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 06:23:09,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-03 06:23:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:09,872 INFO L225 Difference]: With dead ends: 68189 [2018-12-03 06:23:09,873 INFO L226 Difference]: Without dead ends: 67313 [2018-12-03 06:23:09,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-03 06:23:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67313 states. [2018-12-03 06:23:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67313 to 43240. [2018-12-03 06:23:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43240 states. [2018-12-03 06:23:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43240 states to 43240 states and 135793 transitions. [2018-12-03 06:23:10,466 INFO L78 Accepts]: Start accepts. Automaton has 43240 states and 135793 transitions. Word has length 82 [2018-12-03 06:23:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:10,467 INFO L480 AbstractCegarLoop]: Abstraction has 43240 states and 135793 transitions. [2018-12-03 06:23:10,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:23:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43240 states and 135793 transitions. [2018-12-03 06:23:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:10,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:10,497 INFO L402 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] [2018-12-03 06:23:10,497 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:10,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2141783017, now seen corresponding path program 1 times [2018-12-03 06:23:10,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:10,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:10,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:10,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:10,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:10,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:10,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:23:10,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:10,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:23:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:23:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:23:10,573 INFO L87 Difference]: Start difference. First operand 43240 states and 135793 transitions. Second operand 8 states. [2018-12-03 06:23:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:11,352 INFO L93 Difference]: Finished difference Result 54812 states and 170417 transitions. [2018-12-03 06:23:11,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:23:11,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-03 06:23:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:11,429 INFO L225 Difference]: With dead ends: 54812 [2018-12-03 06:23:11,429 INFO L226 Difference]: Without dead ends: 54812 [2018-12-03 06:23:11,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-03 06:23:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54812 states. [2018-12-03 06:23:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54812 to 38160. [2018-12-03 06:23:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38160 states. [2018-12-03 06:23:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38160 states to 38160 states and 120067 transitions. [2018-12-03 06:23:11,933 INFO L78 Accepts]: Start accepts. Automaton has 38160 states and 120067 transitions. Word has length 82 [2018-12-03 06:23:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:11,934 INFO L480 AbstractCegarLoop]: Abstraction has 38160 states and 120067 transitions. [2018-12-03 06:23:11,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:23:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38160 states and 120067 transitions. [2018-12-03 06:23:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:11,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:11,962 INFO L402 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] [2018-12-03 06:23:11,962 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:11,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1672467863, now seen corresponding path program 1 times [2018-12-03 06:23:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:11,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:12,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 06:23:12,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:12,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:23:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:23:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:23:12,044 INFO L87 Difference]: Start difference. First operand 38160 states and 120067 transitions. Second operand 9 states. [2018-12-03 06:23:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:14,322 INFO L93 Difference]: Finished difference Result 54768 states and 167807 transitions. [2018-12-03 06:23:14,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:23:14,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-03 06:23:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:14,394 INFO L225 Difference]: With dead ends: 54768 [2018-12-03 06:23:14,395 INFO L226 Difference]: Without dead ends: 54768 [2018-12-03 06:23:14,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-03 06:23:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54768 states. [2018-12-03 06:23:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54768 to 41204. [2018-12-03 06:23:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41204 states. [2018-12-03 06:23:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41204 states to 41204 states and 129330 transitions. [2018-12-03 06:23:14,940 INFO L78 Accepts]: Start accepts. Automaton has 41204 states and 129330 transitions. Word has length 82 [2018-12-03 06:23:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:14,940 INFO L480 AbstractCegarLoop]: Abstraction has 41204 states and 129330 transitions. [2018-12-03 06:23:14,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:23:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 41204 states and 129330 transitions. [2018-12-03 06:23:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 06:23:14,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:14,970 INFO L402 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] [2018-12-03 06:23:14,970 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:14,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash -427703382, now seen corresponding path program 1 times [2018-12-03 06:23:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:14,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:14,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:15,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:23:15,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:15,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:23:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:23:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:23:15,000 INFO L87 Difference]: Start difference. First operand 41204 states and 129330 transitions. Second operand 5 states. [2018-12-03 06:23:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:15,024 INFO L93 Difference]: Finished difference Result 5368 states and 14053 transitions. [2018-12-03 06:23:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:23:15,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-03 06:23:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:15,029 INFO L225 Difference]: With dead ends: 5368 [2018-12-03 06:23:15,029 INFO L226 Difference]: Without dead ends: 4792 [2018-12-03 06:23:15,029 INFO L631 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 [2018-12-03 06:23:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2018-12-03 06:23:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4628. [2018-12-03 06:23:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4628 states. [2018-12-03 06:23:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 12173 transitions. [2018-12-03 06:23:15,066 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 12173 transitions. Word has length 82 [2018-12-03 06:23:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:15,066 INFO L480 AbstractCegarLoop]: Abstraction has 4628 states and 12173 transitions. [2018-12-03 06:23:15,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:23:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 12173 transitions. [2018-12-03 06:23:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:23:15,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:15,070 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:15,070 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:15,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1928340439, now seen corresponding path program 1 times [2018-12-03 06:23:15,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:15,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:15,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:15,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:15,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:23:15,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:15,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:23:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:23:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:23:15,111 INFO L87 Difference]: Start difference. First operand 4628 states and 12173 transitions. Second operand 5 states. [2018-12-03 06:23:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:15,227 INFO L93 Difference]: Finished difference Result 5288 states and 13754 transitions. [2018-12-03 06:23:15,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:23:15,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:23:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:15,233 INFO L225 Difference]: With dead ends: 5288 [2018-12-03 06:23:15,233 INFO L226 Difference]: Without dead ends: 5288 [2018-12-03 06:23:15,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:23:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2018-12-03 06:23:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4680. [2018-12-03 06:23:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2018-12-03 06:23:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 12285 transitions. [2018-12-03 06:23:15,283 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 12285 transitions. Word has length 94 [2018-12-03 06:23:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:15,284 INFO L480 AbstractCegarLoop]: Abstraction has 4680 states and 12285 transitions. [2018-12-03 06:23:15,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:23:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 12285 transitions. [2018-12-03 06:23:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:23:15,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:15,287 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:15,287 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:15,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash -758672297, now seen corresponding path program 1 times [2018-12-03 06:23:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:15,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:15,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:15,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:23:15,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:15,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:23:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:23:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:23:15,346 INFO L87 Difference]: Start difference. First operand 4680 states and 12285 transitions. Second operand 6 states. [2018-12-03 06:23:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:15,572 INFO L93 Difference]: Finished difference Result 4961 states and 12836 transitions. [2018-12-03 06:23:15,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:23:15,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 06:23:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:15,576 INFO L225 Difference]: With dead ends: 4961 [2018-12-03 06:23:15,576 INFO L226 Difference]: Without dead ends: 4924 [2018-12-03 06:23:15,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2018-12-03 06:23:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4854. [2018-12-03 06:23:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2018-12-03 06:23:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 12636 transitions. [2018-12-03 06:23:15,608 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 12636 transitions. Word has length 94 [2018-12-03 06:23:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:15,608 INFO L480 AbstractCegarLoop]: Abstraction has 4854 states and 12636 transitions. [2018-12-03 06:23:15,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:23:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 12636 transitions. [2018-12-03 06:23:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:23:15,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:15,611 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:15,611 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:15,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 942068182, now seen corresponding path program 1 times [2018-12-03 06:23:15,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:15,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:15,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:15,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:15,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:23:15,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:23:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:23:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:15,684 INFO L87 Difference]: Start difference. First operand 4854 states and 12636 transitions. Second operand 7 states. [2018-12-03 06:23:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:15,905 INFO L93 Difference]: Finished difference Result 5162 states and 13383 transitions. [2018-12-03 06:23:15,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:23:15,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 06:23:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:15,909 INFO L225 Difference]: With dead ends: 5162 [2018-12-03 06:23:15,909 INFO L226 Difference]: Without dead ends: 5162 [2018-12-03 06:23:15,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2018-12-03 06:23:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 4836. [2018-12-03 06:23:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2018-12-03 06:23:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 12599 transitions. [2018-12-03 06:23:15,944 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 12599 transitions. Word has length 94 [2018-12-03 06:23:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:15,944 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 12599 transitions. [2018-12-03 06:23:15,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:23:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 12599 transitions. [2018-12-03 06:23:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:23:15,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:15,947 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:15,947 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:15,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:15,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1942019594, now seen corresponding path program 1 times [2018-12-03 06:23:15,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:15,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:15,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:15,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:23:15,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:15,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:23:15,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:23:15,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:23:15,993 INFO L87 Difference]: Start difference. First operand 4836 states and 12599 transitions. Second operand 5 states. [2018-12-03 06:23:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:16,063 INFO L93 Difference]: Finished difference Result 4836 states and 12558 transitions. [2018-12-03 06:23:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:23:16,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:23:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:16,067 INFO L225 Difference]: With dead ends: 4836 [2018-12-03 06:23:16,067 INFO L226 Difference]: Without dead ends: 4836 [2018-12-03 06:23:16,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:23:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2018-12-03 06:23:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4836. [2018-12-03 06:23:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2018-12-03 06:23:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 12558 transitions. [2018-12-03 06:23:16,105 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 12558 transitions. Word has length 94 [2018-12-03 06:23:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:16,105 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 12558 transitions. [2018-12-03 06:23:16,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:23:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 12558 transitions. [2018-12-03 06:23:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:23:16,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:16,108 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:16,108 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:16,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 306211757, now seen corresponding path program 1 times [2018-12-03 06:23:16,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:16,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:16,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:23:16,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:16,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:23:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:23:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:23:16,146 INFO L87 Difference]: Start difference. First operand 4836 states and 12558 transitions. Second operand 5 states. [2018-12-03 06:23:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:16,264 INFO L93 Difference]: Finished difference Result 9489 states and 24896 transitions. [2018-12-03 06:23:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:23:16,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:23:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:16,271 INFO L225 Difference]: With dead ends: 9489 [2018-12-03 06:23:16,271 INFO L226 Difference]: Without dead ends: 9489 [2018-12-03 06:23:16,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:23:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9489 states. [2018-12-03 06:23:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9489 to 4892. [2018-12-03 06:23:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4892 states. [2018-12-03 06:23:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 12672 transitions. [2018-12-03 06:23:16,320 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 12672 transitions. Word has length 94 [2018-12-03 06:23:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:16,320 INFO L480 AbstractCegarLoop]: Abstraction has 4892 states and 12672 transitions. [2018-12-03 06:23:16,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:23:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 12672 transitions. [2018-12-03 06:23:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:23:16,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:16,323 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:16,323 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:16,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2053095252, now seen corresponding path program 1 times [2018-12-03 06:23:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:16,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:16,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:23:16,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:16,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:23:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:23:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:23:16,381 INFO L87 Difference]: Start difference. First operand 4892 states and 12672 transitions. Second operand 6 states. [2018-12-03 06:23:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:16,428 INFO L93 Difference]: Finished difference Result 3772 states and 9408 transitions. [2018-12-03 06:23:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:23:16,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 06:23:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:16,431 INFO L225 Difference]: With dead ends: 3772 [2018-12-03 06:23:16,431 INFO L226 Difference]: Without dead ends: 3772 [2018-12-03 06:23:16,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2018-12-03 06:23:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3058. [2018-12-03 06:23:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2018-12-03 06:23:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 7722 transitions. [2018-12-03 06:23:16,453 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 7722 transitions. Word has length 94 [2018-12-03 06:23:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:16,454 INFO L480 AbstractCegarLoop]: Abstraction has 3058 states and 7722 transitions. [2018-12-03 06:23:16,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:23:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 7722 transitions. [2018-12-03 06:23:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:23:16,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:16,456 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:16,456 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:16,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-03 06:23:16,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:16,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:16,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:23:16,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:16,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:23:16,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:23:16,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:23:16,503 INFO L87 Difference]: Start difference. First operand 3058 states and 7722 transitions. Second operand 8 states. [2018-12-03 06:23:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:16,803 INFO L93 Difference]: Finished difference Result 7304 states and 18572 transitions. [2018-12-03 06:23:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 06:23:16,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-03 06:23:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:16,808 INFO L225 Difference]: With dead ends: 7304 [2018-12-03 06:23:16,808 INFO L226 Difference]: Without dead ends: 7272 [2018-12-03 06:23:16,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-03 06:23:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-03 06:23:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 3769. [2018-12-03 06:23:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2018-12-03 06:23:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 9441 transitions. [2018-12-03 06:23:16,844 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 9441 transitions. Word has length 96 [2018-12-03 06:23:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:16,844 INFO L480 AbstractCegarLoop]: Abstraction has 3769 states and 9441 transitions. [2018-12-03 06:23:16,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:23:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 9441 transitions. [2018-12-03 06:23:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:23:16,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:16,847 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:16,847 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:16,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-03 06:23:16,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:16,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:23:16,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:16,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:23:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:23:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:23:16,899 INFO L87 Difference]: Start difference. First operand 3769 states and 9441 transitions. Second operand 5 states. [2018-12-03 06:23:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:16,926 INFO L93 Difference]: Finished difference Result 5639 states and 14430 transitions. [2018-12-03 06:23:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:23:16,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 06:23:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:16,930 INFO L225 Difference]: With dead ends: 5639 [2018-12-03 06:23:16,930 INFO L226 Difference]: Without dead ends: 5639 [2018-12-03 06:23:16,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:23:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2018-12-03 06:23:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3550. [2018-12-03 06:23:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-12-03 06:23:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 8942 transitions. [2018-12-03 06:23:16,961 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 8942 transitions. Word has length 96 [2018-12-03 06:23:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:16,961 INFO L480 AbstractCegarLoop]: Abstraction has 3550 states and 8942 transitions. [2018-12-03 06:23:16,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:23:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 8942 transitions. [2018-12-03 06:23:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:23:16,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:16,963 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:16,963 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:16,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-03 06:23:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:16,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:23:16,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:16,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:23:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:23:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:23:16,999 INFO L87 Difference]: Start difference. First operand 3550 states and 8942 transitions. Second operand 5 states. [2018-12-03 06:23:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:17,096 INFO L93 Difference]: Finished difference Result 3998 states and 10046 transitions. [2018-12-03 06:23:17,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:23:17,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 06:23:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:17,099 INFO L225 Difference]: With dead ends: 3998 [2018-12-03 06:23:17,100 INFO L226 Difference]: Without dead ends: 3966 [2018-12-03 06:23:17,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:23:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2018-12-03 06:23:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3046. [2018-12-03 06:23:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2018-12-03 06:23:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 7688 transitions. [2018-12-03 06:23:17,122 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 7688 transitions. Word has length 96 [2018-12-03 06:23:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:17,122 INFO L480 AbstractCegarLoop]: Abstraction has 3046 states and 7688 transitions. [2018-12-03 06:23:17,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:23:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 7688 transitions. [2018-12-03 06:23:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:23:17,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:17,125 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:17,125 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:17,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-03 06:23:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:17,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:17,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:17,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:17,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:23:17,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:17,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 06:23:17,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 06:23:17,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:23:17,205 INFO L87 Difference]: Start difference. First operand 3046 states and 7688 transitions. Second operand 10 states. [2018-12-03 06:23:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:17,462 INFO L93 Difference]: Finished difference Result 5121 states and 13059 transitions. [2018-12-03 06:23:17,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:23:17,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 06:23:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:17,464 INFO L225 Difference]: With dead ends: 5121 [2018-12-03 06:23:17,464 INFO L226 Difference]: Without dead ends: 2051 [2018-12-03 06:23:17,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 06:23:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2018-12-03 06:23:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2018-12-03 06:23:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-03 06:23:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-03 06:23:17,478 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-03 06:23:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:17,478 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-03 06:23:17,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 06:23:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-03 06:23:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:23:17,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:17,480 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:17,480 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:17,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-03 06:23:17,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:23:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:17,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:23:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:23:17,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:23:17,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 06:23:17,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:23:17,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 06:23:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 06:23:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:23:17,559 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-03 06:23:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:23:17,923 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-03 06:23:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:23:17,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-03 06:23:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:23:17,926 INFO L225 Difference]: With dead ends: 3882 [2018-12-03 06:23:17,926 INFO L226 Difference]: Without dead ends: 2746 [2018-12-03 06:23:17,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:23:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-03 06:23:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-03 06:23:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-03 06:23:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-03 06:23:17,944 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-03 06:23:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:23:17,945 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-03 06:23:17,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 06:23:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-03 06:23:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:23:17,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:23:17,946 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:23:17,947 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:23:17,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:23:17,947 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-03 06:23:17,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:23:17,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:17,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:23:17,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:23:17,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:23:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:23:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:23:17,994 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:23:18,074 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 06:23:18,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:23:18 BasicIcfg [2018-12-03 06:23:18,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:23:18,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:23:18,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:23:18,075 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:23:18,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:22:34" (3/4) ... [2018-12-03 06:23:18,078 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:23:18,155 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e0779f7f-74c4-46e3-9a39-954a23be5bc3/bin-2019/utaipan/witness.graphml [2018-12-03 06:23:18,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:23:18,155 INFO L168 Benchmark]: Toolchain (without parser) took 44473.65 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 947.0 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,156 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:23:18,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.98 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,157 INFO L168 Benchmark]: Boogie Preprocessor took 20.74 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,157 INFO L168 Benchmark]: RCFGBuilder took 364.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,157 INFO L168 Benchmark]: TraceAbstraction took 43614.10 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,157 INFO L168 Benchmark]: Witness Printer took 79.48 ms. Allocated memory is still 4.4 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2018-12-03 06:23:18,158 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.98 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.74 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43614.10 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 79.48 ms. Allocated memory is still 4.4 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L765] -1 pthread_t t1613; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L766] FCALL, FORK -1 pthread_create(&t1613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] -1 pthread_t t1614; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L768] FCALL, FORK -1 pthread_create(&t1614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 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 [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -1 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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -1 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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 43.5s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11301 SDtfs, 13092 SDslu, 29670 SDs, 0 SdLazy, 14368 SolverSat, 805 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 117 SyntacticMatches, 24 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111084occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 20.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 420461 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2771 ConstructedInterpolants, 0 QuantifiedInterpolants, 523124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...