./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_tso.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_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/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 d8ad336436625e6f9cd92efafa328dff9ef611fd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 19:26:04,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:26:04,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:26:04,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:26:04,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:26:04,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:26:04,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:26:04,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:26:04,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:26:04,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:26:04,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:26:04,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:26:04,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:26:04,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:26:04,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:26:04,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:26:04,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:26:04,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:26:04,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:26:04,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:26:04,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:26:04,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:26:04,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:26:04,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:26:04,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:26:04,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:26:04,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:26:04,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:26:04,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:26:04,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:26:04,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:26:04,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:26:04,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:26:04,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:26:04,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:26:04,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:26:04,835 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:26:04,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:26:04,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:26:04,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:26:04,843 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:26:04,843 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:26:04,843 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:26:04,843 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:26:04,844 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:26:04,844 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:26:04,844 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:26:04,844 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:26:04,844 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:26:04,844 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:26:04,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:26:04,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:26:04,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:26:04,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:26:04,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:26:04,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:26:04,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:26:04,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:26:04,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:26:04,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:26:04,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:26:04,848 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_a3f98124-6764-4093-b186-5133c610586b/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 -> d8ad336436625e6f9cd92efafa328dff9ef611fd [2018-12-09 19:26:04,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:26:04,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:26:04,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:26:04,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:26:04,875 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:26:04,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i [2018-12-09 19:26:04,909 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/data/442ca9821/f97daff835c04b5c82388aae905d7021/FLAGcb63506f3 [2018-12-09 19:26:05,370 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:26:05,371 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/sv-benchmarks/c/pthread-wmm/rfi010_tso.opt_false-unreach-call.i [2018-12-09 19:26:05,377 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/data/442ca9821/f97daff835c04b5c82388aae905d7021/FLAGcb63506f3 [2018-12-09 19:26:05,385 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/data/442ca9821/f97daff835c04b5c82388aae905d7021 [2018-12-09 19:26:05,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:26:05,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:26:05,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:26:05,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:26:05,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:26:05,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05, skipping insertion in model container [2018-12-09 19:26:05,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:26:05,418 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:26:05,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:26:05,608 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:26:05,680 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:26:05,710 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:26:05,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05 WrapperNode [2018-12-09 19:26:05,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:26:05,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:26:05,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:26:05,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:26:05,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:26:05,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:26:05,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:26:05,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:26:05,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... [2018-12-09 19:26:05,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:26:05,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:26:05,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:26:05,767 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:26:05,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/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-09 19:26:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:26:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:26:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:26:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:26:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:26:05,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:26:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:26:05,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:26:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:26:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:26:05,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:26:05,804 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:26:06,136 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:26:06,136 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:26:06,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:06 BoogieIcfgContainer [2018-12-09 19:26:06,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:26:06,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:26:06,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:26:06,139 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:26:06,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:26:05" (1/3) ... [2018-12-09 19:26:06,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58630172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:26:06, skipping insertion in model container [2018-12-09 19:26:06,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:05" (2/3) ... [2018-12-09 19:26:06,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58630172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:26:06, skipping insertion in model container [2018-12-09 19:26:06,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:06" (3/3) ... [2018-12-09 19:26:06,141 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_tso.opt_false-unreach-call.i [2018-12-09 19:26:06,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,175 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:26:06,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:26:06,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:26:06,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:26:06,209 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:26:06,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:26:06,224 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:26:06,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:26:06,225 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:26:06,225 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:26:06,225 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:26:06,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:26:06,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:26:06,232 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-09 19:26:12,000 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-09 19:26:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-09 19:26:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:26:12,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:12,011 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-09 19:26:12,012 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:12,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-09 19:26:12,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:12,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:12,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:12,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:12,209 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-09 19:26:12,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:12,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:12,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:12,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:12,224 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-09 19:26:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:13,118 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-09 19:26:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:13,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 19:26:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:13,708 INFO L225 Difference]: With dead ends: 150583 [2018-12-09 19:26:13,708 INFO L226 Difference]: Without dead ends: 105839 [2018-12-09 19:26:13,709 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-09 19:26:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-09 19:26:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-09 19:26:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-09 19:26:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-09 19:26:15,810 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-09 19:26:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:15,810 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-09 19:26:15,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-09 19:26:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:26:15,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:15,816 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-09 19:26:15,816 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:15,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-09 19:26:15,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:15,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:15,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:15,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:15,866 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-09 19:26:15,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:15,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:26:15,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:15,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:26:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:26:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:26:15,868 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-09 19:26:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:17,805 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-09 19:26:17,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:26:17,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 19:26:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:18,158 INFO L225 Difference]: With dead ends: 146039 [2018-12-09 19:26:18,158 INFO L226 Difference]: Without dead ends: 145471 [2018-12-09 19:26:18,158 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-09 19:26:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-09 19:26:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-09 19:26:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-09 19:26:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-09 19:26:20,620 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-09 19:26:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:20,621 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-09 19:26:20,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:26:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-09 19:26:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:26:20,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:20,625 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] [2018-12-09 19:26:20,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:20,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1415245602, now seen corresponding path program 1 times [2018-12-09 19:26:20,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:20,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:20,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:20,673 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-09 19:26:20,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:20,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:26:20,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:20,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:26:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:26:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:26:20,674 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-09 19:26:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:21,875 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-09 19:26:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:26:21,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 19:26:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:22,313 INFO L225 Difference]: With dead ends: 199269 [2018-12-09 19:26:22,313 INFO L226 Difference]: Without dead ends: 198805 [2018-12-09 19:26:22,313 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-09 19:26:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-09 19:26:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-09 19:26:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-09 19:26:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-09 19:26:25,768 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-09 19:26:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:25,768 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-09 19:26:25,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:26:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-09 19:26:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:26:25,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:25,775 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] [2018-12-09 19:26:25,775 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:25,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1958778492, now seen corresponding path program 1 times [2018-12-09 19:26:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:25,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:25,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:25,802 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-09 19:26:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:25,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:26:25,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:25,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:25,804 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-09 19:26:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:26,493 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-09 19:26:26,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:26,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 19:26:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:26,858 INFO L225 Difference]: With dead ends: 179115 [2018-12-09 19:26:26,859 INFO L226 Difference]: Without dead ends: 179115 [2018-12-09 19:26:26,859 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-09 19:26:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-09 19:26:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-09 19:26:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-09 19:26:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-09 19:26:31,755 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-09 19:26:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:31,756 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-09 19:26:31,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:26:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-09 19:26:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:26:31,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:31,772 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-09 19:26:31,772 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:31,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash 984479439, now seen corresponding path program 1 times [2018-12-09 19:26:31,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:31,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:31,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:31,828 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-09 19:26:31,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:26:31,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:31,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:31,829 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-09 19:26:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:33,771 INFO L93 Difference]: Finished difference Result 315523 states and 1139598 transitions. [2018-12-09 19:26:33,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:26:33,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 19:26:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:34,424 INFO L225 Difference]: With dead ends: 315523 [2018-12-09 19:26:34,424 INFO L226 Difference]: Without dead ends: 314987 [2018-12-09 19:26:34,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:26:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314987 states. [2018-12-09 19:26:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314987 to 164409. [2018-12-09 19:26:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164409 states. [2018-12-09 19:26:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164409 states to 164409 states and 606496 transitions. [2018-12-09 19:26:39,468 INFO L78 Accepts]: Start accepts. Automaton has 164409 states and 606496 transitions. Word has length 53 [2018-12-09 19:26:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:39,468 INFO L480 AbstractCegarLoop]: Abstraction has 164409 states and 606496 transitions. [2018-12-09 19:26:39,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 164409 states and 606496 transitions. [2018-12-09 19:26:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:26:39,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:39,483 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-09 19:26:39,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:39,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-09 19:26:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:39,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:39,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:39,562 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-09 19:26:39,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:39,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:26:39,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:39,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:39,563 INFO L87 Difference]: Start difference. First operand 164409 states and 606496 transitions. Second operand 6 states. [2018-12-09 19:26:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:40,814 INFO L93 Difference]: Finished difference Result 215866 states and 792770 transitions. [2018-12-09 19:26:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:26:40,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 19:26:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:41,293 INFO L225 Difference]: With dead ends: 215866 [2018-12-09 19:26:41,293 INFO L226 Difference]: Without dead ends: 215866 [2018-12-09 19:26:41,293 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-09 19:26:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215866 states. [2018-12-09 19:26:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215866 to 201215. [2018-12-09 19:26:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201215 states. [2018-12-09 19:26:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201215 states to 201215 states and 739037 transitions. [2018-12-09 19:26:47,325 INFO L78 Accepts]: Start accepts. Automaton has 201215 states and 739037 transitions. Word has length 53 [2018-12-09 19:26:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:47,325 INFO L480 AbstractCegarLoop]: Abstraction has 201215 states and 739037 transitions. [2018-12-09 19:26:47,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 201215 states and 739037 transitions. [2018-12-09 19:26:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:26:47,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:47,343 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-09 19:26:47,343 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:47,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-09 19:26:47,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:47,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:47,403 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-09 19:26:47,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:47,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:26:47,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:47,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:26:47,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:26:47,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:26:47,404 INFO L87 Difference]: Start difference. First operand 201215 states and 739037 transitions. Second operand 7 states. [2018-12-09 19:26:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:49,102 INFO L93 Difference]: Finished difference Result 286186 states and 1016985 transitions. [2018-12-09 19:26:49,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:26:49,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 19:26:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:50,137 INFO L225 Difference]: With dead ends: 286186 [2018-12-09 19:26:50,138 INFO L226 Difference]: Without dead ends: 286186 [2018-12-09 19:26:50,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:26:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286186 states. [2018-12-09 19:26:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286186 to 229832. [2018-12-09 19:26:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229832 states. [2018-12-09 19:26:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229832 states to 229832 states and 831774 transitions. [2018-12-09 19:26:57,471 INFO L78 Accepts]: Start accepts. Automaton has 229832 states and 831774 transitions. Word has length 53 [2018-12-09 19:26:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:57,471 INFO L480 AbstractCegarLoop]: Abstraction has 229832 states and 831774 transitions. [2018-12-09 19:26:57,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:26:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 229832 states and 831774 transitions. [2018-12-09 19:26:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:26:57,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:57,488 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-09 19:26:57,488 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:57,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-09 19:26:57,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:57,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:57,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:57,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:57,523 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-09 19:26:57,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:57,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:26:57,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:57,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:57,523 INFO L87 Difference]: Start difference. First operand 229832 states and 831774 transitions. Second operand 3 states. [2018-12-09 19:26:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:58,165 INFO L93 Difference]: Finished difference Result 183765 states and 654695 transitions. [2018-12-09 19:26:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:58,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-09 19:26:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:58,530 INFO L225 Difference]: With dead ends: 183765 [2018-12-09 19:26:58,530 INFO L226 Difference]: Without dead ends: 183765 [2018-12-09 19:26:58,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183765 states. [2018-12-09 19:27:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183765 to 178407. [2018-12-09 19:27:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178407 states. [2018-12-09 19:27:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178407 states to 178407 states and 637996 transitions. [2018-12-09 19:27:02,739 INFO L78 Accepts]: Start accepts. Automaton has 178407 states and 637996 transitions. Word has length 53 [2018-12-09 19:27:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:02,739 INFO L480 AbstractCegarLoop]: Abstraction has 178407 states and 637996 transitions. [2018-12-09 19:27:02,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:27:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 178407 states and 637996 transitions. [2018-12-09 19:27:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:27:02,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:02,753 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] [2018-12-09 19:27:02,753 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1514606821, now seen corresponding path program 1 times [2018-12-09 19:27:02,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:02,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:02,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:02,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:02,822 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-09 19:27:02,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:27:02,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:02,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:27:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:27:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:27:02,823 INFO L87 Difference]: Start difference. First operand 178407 states and 637996 transitions. Second operand 6 states. [2018-12-09 19:27:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:03,982 INFO L93 Difference]: Finished difference Result 224186 states and 783823 transitions. [2018-12-09 19:27:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:27:03,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 19:27:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:04,432 INFO L225 Difference]: With dead ends: 224186 [2018-12-09 19:27:04,433 INFO L226 Difference]: Without dead ends: 224186 [2018-12-09 19:27:04,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:27:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224186 states. [2018-12-09 19:27:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224186 to 192266. [2018-12-09 19:27:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192266 states. [2018-12-09 19:27:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192266 states to 192266 states and 683049 transitions. [2018-12-09 19:27:10,327 INFO L78 Accepts]: Start accepts. Automaton has 192266 states and 683049 transitions. Word has length 54 [2018-12-09 19:27:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:10,327 INFO L480 AbstractCegarLoop]: Abstraction has 192266 states and 683049 transitions. [2018-12-09 19:27:10,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:27:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 192266 states and 683049 transitions. [2018-12-09 19:27:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:27:10,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:10,341 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] [2018-12-09 19:27:10,341 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:10,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash -627103140, now seen corresponding path program 1 times [2018-12-09 19:27:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:10,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:10,371 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-09 19:27:10,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:10,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:27:10,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:10,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:27:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:27:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:27:10,372 INFO L87 Difference]: Start difference. First operand 192266 states and 683049 transitions. Second operand 4 states. [2018-12-09 19:27:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:10,466 INFO L93 Difference]: Finished difference Result 29127 states and 92139 transitions. [2018-12-09 19:27:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:27:10,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 19:27:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:10,496 INFO L225 Difference]: With dead ends: 29127 [2018-12-09 19:27:10,496 INFO L226 Difference]: Without dead ends: 22849 [2018-12-09 19:27:10,496 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-09 19:27:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22849 states. [2018-12-09 19:27:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22849 to 22602. [2018-12-09 19:27:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22602 states. [2018-12-09 19:27:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22602 states to 22602 states and 69780 transitions. [2018-12-09 19:27:10,740 INFO L78 Accepts]: Start accepts. Automaton has 22602 states and 69780 transitions. Word has length 54 [2018-12-09 19:27:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:10,740 INFO L480 AbstractCegarLoop]: Abstraction has 22602 states and 69780 transitions. [2018-12-09 19:27:10,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:27:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 22602 states and 69780 transitions. [2018-12-09 19:27:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:27:10,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:10,744 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] [2018-12-09 19:27:10,745 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:10,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash -917178143, now seen corresponding path program 1 times [2018-12-09 19:27:10,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:10,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:10,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:10,781 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-09 19:27:10,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:10,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:27:10,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:10,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:27:10,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:27:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:27:10,782 INFO L87 Difference]: Start difference. First operand 22602 states and 69780 transitions. Second operand 4 states. [2018-12-09 19:27:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:10,968 INFO L93 Difference]: Finished difference Result 29366 states and 90886 transitions. [2018-12-09 19:27:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:27:10,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 19:27:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:11,004 INFO L225 Difference]: With dead ends: 29366 [2018-12-09 19:27:11,005 INFO L226 Difference]: Without dead ends: 29366 [2018-12-09 19:27:11,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29366 states. [2018-12-09 19:27:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29366 to 26238. [2018-12-09 19:27:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26238 states. [2018-12-09 19:27:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26238 states to 26238 states and 80860 transitions. [2018-12-09 19:27:11,314 INFO L78 Accepts]: Start accepts. Automaton has 26238 states and 80860 transitions. Word has length 63 [2018-12-09 19:27:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:11,314 INFO L480 AbstractCegarLoop]: Abstraction has 26238 states and 80860 transitions. [2018-12-09 19:27:11,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:27:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 26238 states and 80860 transitions. [2018-12-09 19:27:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:27:11,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:11,319 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] [2018-12-09 19:27:11,319 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:11,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash 825632192, now seen corresponding path program 1 times [2018-12-09 19:27:11,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:11,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:11,359 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-09 19:27:11,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:11,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:27:11,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:11,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:27:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:27:11,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:27:11,360 INFO L87 Difference]: Start difference. First operand 26238 states and 80860 transitions. Second operand 6 states. [2018-12-09 19:27:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:11,754 INFO L93 Difference]: Finished difference Result 53431 states and 163786 transitions. [2018-12-09 19:27:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:27:11,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 19:27:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:11,826 INFO L225 Difference]: With dead ends: 53431 [2018-12-09 19:27:11,826 INFO L226 Difference]: Without dead ends: 53367 [2018-12-09 19:27:11,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:27:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53367 states. [2018-12-09 19:27:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53367 to 34364. [2018-12-09 19:27:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34364 states. [2018-12-09 19:27:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 104270 transitions. [2018-12-09 19:27:12,312 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 104270 transitions. Word has length 63 [2018-12-09 19:27:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:12,312 INFO L480 AbstractCegarLoop]: Abstraction has 34364 states and 104270 transitions. [2018-12-09 19:27:12,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:27:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 104270 transitions. [2018-12-09 19:27:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:27:12,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:12,321 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-09 19:27:12,322 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:12,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1816196687, now seen corresponding path program 1 times [2018-12-09 19:27:12,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:12,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:12,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:12,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:12,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:12,342 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-09 19:27:12,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:12,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:27:12,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:12,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:27:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:27:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:27:12,343 INFO L87 Difference]: Start difference. First operand 34364 states and 104270 transitions. Second operand 3 states. [2018-12-09 19:27:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:12,486 INFO L93 Difference]: Finished difference Result 37960 states and 113326 transitions. [2018-12-09 19:27:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:27:12,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 19:27:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:12,534 INFO L225 Difference]: With dead ends: 37960 [2018-12-09 19:27:12,534 INFO L226 Difference]: Without dead ends: 37960 [2018-12-09 19:27:12,534 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-09 19:27:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37960 states. [2018-12-09 19:27:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37960 to 33288. [2018-12-09 19:27:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33288 states. [2018-12-09 19:27:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33288 states to 33288 states and 98676 transitions. [2018-12-09 19:27:13,149 INFO L78 Accepts]: Start accepts. Automaton has 33288 states and 98676 transitions. Word has length 69 [2018-12-09 19:27:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:13,149 INFO L480 AbstractCegarLoop]: Abstraction has 33288 states and 98676 transitions. [2018-12-09 19:27:13,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:27:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33288 states and 98676 transitions. [2018-12-09 19:27:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:27:13,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:13,158 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] [2018-12-09 19:27:13,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:13,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash 927307833, now seen corresponding path program 1 times [2018-12-09 19:27:13,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:13,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:13,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:13,201 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-09 19:27:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:27:13,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:13,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:27:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:27:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:27:13,202 INFO L87 Difference]: Start difference. First operand 33288 states and 98676 transitions. Second operand 4 states. [2018-12-09 19:27:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:13,625 INFO L93 Difference]: Finished difference Result 44424 states and 131972 transitions. [2018-12-09 19:27:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:27:13,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-09 19:27:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:13,676 INFO L225 Difference]: With dead ends: 44424 [2018-12-09 19:27:13,676 INFO L226 Difference]: Without dead ends: 43848 [2018-12-09 19:27:13,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43848 states. [2018-12-09 19:27:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43848 to 41436. [2018-12-09 19:27:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41436 states. [2018-12-09 19:27:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41436 states to 41436 states and 122987 transitions. [2018-12-09 19:27:14,144 INFO L78 Accepts]: Start accepts. Automaton has 41436 states and 122987 transitions. Word has length 71 [2018-12-09 19:27:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:14,144 INFO L480 AbstractCegarLoop]: Abstraction has 41436 states and 122987 transitions. [2018-12-09 19:27:14,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:27:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41436 states and 122987 transitions. [2018-12-09 19:27:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:27:14,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:14,156 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] [2018-12-09 19:27:14,156 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:14,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash -869643526, now seen corresponding path program 1 times [2018-12-09 19:27:14,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:14,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:14,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:14,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:14,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:14,232 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-09 19:27:14,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:14,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:27:14,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:14,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:27:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:27:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:27:14,232 INFO L87 Difference]: Start difference. First operand 41436 states and 122987 transitions. Second operand 8 states. [2018-12-09 19:27:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:14,827 INFO L93 Difference]: Finished difference Result 48133 states and 141125 transitions. [2018-12-09 19:27:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:27:14,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-12-09 19:27:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:14,903 INFO L225 Difference]: With dead ends: 48133 [2018-12-09 19:27:14,903 INFO L226 Difference]: Without dead ends: 48133 [2018-12-09 19:27:14,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:27:14,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48133 states. [2018-12-09 19:27:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48133 to 44392. [2018-12-09 19:27:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44392 states. [2018-12-09 19:27:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44392 states to 44392 states and 130936 transitions. [2018-12-09 19:27:15,404 INFO L78 Accepts]: Start accepts. Automaton has 44392 states and 130936 transitions. Word has length 71 [2018-12-09 19:27:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:15,404 INFO L480 AbstractCegarLoop]: Abstraction has 44392 states and 130936 transitions. [2018-12-09 19:27:15,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:27:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44392 states and 130936 transitions. [2018-12-09 19:27:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:27:15,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:15,415 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] [2018-12-09 19:27:15,415 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:15,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:15,416 INFO L82 PathProgramCache]: Analyzing trace with hash 17860155, now seen corresponding path program 1 times [2018-12-09 19:27:15,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:15,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:15,447 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-09 19:27:15,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:15,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:27:15,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:15,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:27:15,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:27:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:15,448 INFO L87 Difference]: Start difference. First operand 44392 states and 130936 transitions. Second operand 5 states. [2018-12-09 19:27:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:15,482 INFO L93 Difference]: Finished difference Result 11932 states and 29919 transitions. [2018-12-09 19:27:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:27:15,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 19:27:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:15,490 INFO L225 Difference]: With dead ends: 11932 [2018-12-09 19:27:15,490 INFO L226 Difference]: Without dead ends: 10080 [2018-12-09 19:27:15,490 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-09 19:27:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10080 states. [2018-12-09 19:27:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10080 to 7653. [2018-12-09 19:27:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7653 states. [2018-12-09 19:27:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 19062 transitions. [2018-12-09 19:27:15,560 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 19062 transitions. Word has length 71 [2018-12-09 19:27:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:15,560 INFO L480 AbstractCegarLoop]: Abstraction has 7653 states and 19062 transitions. [2018-12-09 19:27:15,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:27:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 19062 transitions. [2018-12-09 19:27:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:15,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:15,566 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, 1, 1, 1, 1] [2018-12-09 19:27:15,566 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:15,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1041459284, now seen corresponding path program 1 times [2018-12-09 19:27:15,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:15,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:15,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:15,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:15,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:15,612 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-09 19:27:15,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:15,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:27:15,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:15,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:27:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:27:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:27:15,613 INFO L87 Difference]: Start difference. First operand 7653 states and 19062 transitions. Second operand 4 states. [2018-12-09 19:27:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:15,749 INFO L93 Difference]: Finished difference Result 9032 states and 22112 transitions. [2018-12-09 19:27:15,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:27:15,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 19:27:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:15,755 INFO L225 Difference]: With dead ends: 9032 [2018-12-09 19:27:15,756 INFO L226 Difference]: Without dead ends: 9032 [2018-12-09 19:27:15,756 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-09 19:27:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2018-12-09 19:27:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 8326. [2018-12-09 19:27:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2018-12-09 19:27:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 20517 transitions. [2018-12-09 19:27:15,918 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 20517 transitions. Word has length 100 [2018-12-09 19:27:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:15,918 INFO L480 AbstractCegarLoop]: Abstraction has 8326 states and 20517 transitions. [2018-12-09 19:27:15,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:27:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 20517 transitions. [2018-12-09 19:27:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:15,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:15,923 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, 1, 1, 1, 1] [2018-12-09 19:27:15,923 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:15,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2008743531, now seen corresponding path program 1 times [2018-12-09 19:27:15,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:15,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:15,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:15,995 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-09 19:27:15,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:15,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:27:15,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:15,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:27:15,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:27:15,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:27:15,996 INFO L87 Difference]: Start difference. First operand 8326 states and 20517 transitions. Second operand 8 states. [2018-12-09 19:27:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:16,731 INFO L93 Difference]: Finished difference Result 18094 states and 43167 transitions. [2018-12-09 19:27:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:27:16,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-09 19:27:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:16,743 INFO L225 Difference]: With dead ends: 18094 [2018-12-09 19:27:16,743 INFO L226 Difference]: Without dead ends: 17999 [2018-12-09 19:27:16,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:27:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17999 states. [2018-12-09 19:27:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17999 to 14189. [2018-12-09 19:27:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14189 states. [2018-12-09 19:27:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14189 states to 14189 states and 34364 transitions. [2018-12-09 19:27:16,877 INFO L78 Accepts]: Start accepts. Automaton has 14189 states and 34364 transitions. Word has length 100 [2018-12-09 19:27:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:16,877 INFO L480 AbstractCegarLoop]: Abstraction has 14189 states and 34364 transitions. [2018-12-09 19:27:16,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:27:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14189 states and 34364 transitions. [2018-12-09 19:27:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:16,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:16,888 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, 1, 1, 1, 1] [2018-12-09 19:27:16,888 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:16,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash 209014422, now seen corresponding path program 1 times [2018-12-09 19:27:16,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:16,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:16,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:16,989 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-09 19:27:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:27:16,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:16,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:27:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:27:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:27:16,990 INFO L87 Difference]: Start difference. First operand 14189 states and 34364 transitions. Second operand 7 states. [2018-12-09 19:27:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:17,407 INFO L93 Difference]: Finished difference Result 19352 states and 44884 transitions. [2018-12-09 19:27:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:27:17,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:27:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:17,421 INFO L225 Difference]: With dead ends: 19352 [2018-12-09 19:27:17,421 INFO L226 Difference]: Without dead ends: 19352 [2018-12-09 19:27:17,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:27:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19352 states. [2018-12-09 19:27:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19352 to 16465. [2018-12-09 19:27:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16465 states. [2018-12-09 19:27:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16465 states to 16465 states and 38763 transitions. [2018-12-09 19:27:17,576 INFO L78 Accepts]: Start accepts. Automaton has 16465 states and 38763 transitions. Word has length 100 [2018-12-09 19:27:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:17,577 INFO L480 AbstractCegarLoop]: Abstraction has 16465 states and 38763 transitions. [2018-12-09 19:27:17,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:27:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16465 states and 38763 transitions. [2018-12-09 19:27:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:17,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:17,589 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, 1, 1, 1, 1] [2018-12-09 19:27:17,589 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:17,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 420365335, now seen corresponding path program 1 times [2018-12-09 19:27:17,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:17,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:17,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:17,653 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-09 19:27:17,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:17,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:27:17,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:17,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:27:17,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:27:17,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:27:17,654 INFO L87 Difference]: Start difference. First operand 16465 states and 38763 transitions. Second operand 7 states. [2018-12-09 19:27:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:18,007 INFO L93 Difference]: Finished difference Result 18474 states and 43255 transitions. [2018-12-09 19:27:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:27:18,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:27:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:18,021 INFO L225 Difference]: With dead ends: 18474 [2018-12-09 19:27:18,021 INFO L226 Difference]: Without dead ends: 18474 [2018-12-09 19:27:18,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:27:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18474 states. [2018-12-09 19:27:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18474 to 17057. [2018-12-09 19:27:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17057 states. [2018-12-09 19:27:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17057 states to 17057 states and 40062 transitions. [2018-12-09 19:27:18,169 INFO L78 Accepts]: Start accepts. Automaton has 17057 states and 40062 transitions. Word has length 100 [2018-12-09 19:27:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:18,169 INFO L480 AbstractCegarLoop]: Abstraction has 17057 states and 40062 transitions. [2018-12-09 19:27:18,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:27:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17057 states and 40062 transitions. [2018-12-09 19:27:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:18,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:18,182 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, 1, 1, 1, 1] [2018-12-09 19:27:18,182 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:18,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1887120201, now seen corresponding path program 1 times [2018-12-09 19:27:18,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:18,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:18,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:18,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:18,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:18,257 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-09 19:27:18,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:18,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:27:18,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:18,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:27:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:27:18,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:27:18,258 INFO L87 Difference]: Start difference. First operand 17057 states and 40062 transitions. Second operand 7 states. [2018-12-09 19:27:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:18,428 INFO L93 Difference]: Finished difference Result 17983 states and 42002 transitions. [2018-12-09 19:27:18,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:27:18,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:27:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:18,441 INFO L225 Difference]: With dead ends: 17983 [2018-12-09 19:27:18,441 INFO L226 Difference]: Without dead ends: 17983 [2018-12-09 19:27:18,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:27:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17983 states. [2018-12-09 19:27:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17983 to 16520. [2018-12-09 19:27:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2018-12-09 19:27:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 38816 transitions. [2018-12-09 19:27:18,584 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 38816 transitions. Word has length 100 [2018-12-09 19:27:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:18,584 INFO L480 AbstractCegarLoop]: Abstraction has 16520 states and 38816 transitions. [2018-12-09 19:27:18,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:27:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 38816 transitions. [2018-12-09 19:27:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:18,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:18,597 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, 1, 1, 1, 1] [2018-12-09 19:27:18,597 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:18,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash -999616520, now seen corresponding path program 1 times [2018-12-09 19:27:18,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:18,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:18,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:18,650 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-09 19:27:18,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:18,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:27:18,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:18,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:27:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:27:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:18,651 INFO L87 Difference]: Start difference. First operand 16520 states and 38816 transitions. Second operand 5 states. [2018-12-09 19:27:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:18,899 INFO L93 Difference]: Finished difference Result 19359 states and 45352 transitions. [2018-12-09 19:27:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:27:18,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 19:27:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:18,913 INFO L225 Difference]: With dead ends: 19359 [2018-12-09 19:27:18,913 INFO L226 Difference]: Without dead ends: 19359 [2018-12-09 19:27:18,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:27:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2018-12-09 19:27:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 15812. [2018-12-09 19:27:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15812 states. [2018-12-09 19:27:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 37143 transitions. [2018-12-09 19:27:19,056 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 37143 transitions. Word has length 100 [2018-12-09 19:27:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:19,057 INFO L480 AbstractCegarLoop]: Abstraction has 15812 states and 37143 transitions. [2018-12-09 19:27:19,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:27:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 37143 transitions. [2018-12-09 19:27:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:27:19,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:19,068 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, 1, 1, 1, 1] [2018-12-09 19:27:19,069 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:19,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash 845842068, now seen corresponding path program 2 times [2018-12-09 19:27:19,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:19,104 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-09 19:27:19,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:19,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:27:19,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:19,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:27:19,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:27:19,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:19,105 INFO L87 Difference]: Start difference. First operand 15812 states and 37143 transitions. Second operand 5 states. [2018-12-09 19:27:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:19,255 INFO L93 Difference]: Finished difference Result 17772 states and 41236 transitions. [2018-12-09 19:27:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:27:19,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 19:27:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:19,268 INFO L225 Difference]: With dead ends: 17772 [2018-12-09 19:27:19,268 INFO L226 Difference]: Without dead ends: 17772 [2018-12-09 19:27:19,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-09 19:27:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2018-12-09 19:27:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 15941. [2018-12-09 19:27:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15941 states. [2018-12-09 19:27:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15941 states to 15941 states and 37408 transitions. [2018-12-09 19:27:19,407 INFO L78 Accepts]: Start accepts. Automaton has 15941 states and 37408 transitions. Word has length 100 [2018-12-09 19:27:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:19,407 INFO L480 AbstractCegarLoop]: Abstraction has 15941 states and 37408 transitions. [2018-12-09 19:27:19,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:27:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15941 states and 37408 transitions. [2018-12-09 19:27:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:27:19,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:19,420 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:27:19,420 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:19,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:19,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1287446147, now seen corresponding path program 1 times [2018-12-09 19:27:19,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:27:19,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:19,494 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-09 19:27:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:19,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:27:19,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:19,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:27:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:27:19,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:27:19,494 INFO L87 Difference]: Start difference. First operand 15941 states and 37408 transitions. Second operand 9 states. [2018-12-09 19:27:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:19,609 INFO L93 Difference]: Finished difference Result 19424 states and 45800 transitions. [2018-12-09 19:27:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:27:19,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-12-09 19:27:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:19,612 INFO L225 Difference]: With dead ends: 19424 [2018-12-09 19:27:19,612 INFO L226 Difference]: Without dead ends: 3672 [2018-12-09 19:27:19,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:27:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2018-12-09 19:27:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3670. [2018-12-09 19:27:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3670 states. [2018-12-09 19:27:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 8692 transitions. [2018-12-09 19:27:19,635 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 8692 transitions. Word has length 102 [2018-12-09 19:27:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:19,635 INFO L480 AbstractCegarLoop]: Abstraction has 3670 states and 8692 transitions. [2018-12-09 19:27:19,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:27:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 8692 transitions. [2018-12-09 19:27:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:27:19,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:19,637 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:27:19,637 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:19,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash -373689113, now seen corresponding path program 1 times [2018-12-09 19:27:19,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:19,679 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-09 19:27:19,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:19,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:27:19,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:19,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:27:19,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:27:19,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:19,680 INFO L87 Difference]: Start difference. First operand 3670 states and 8692 transitions. Second operand 5 states. [2018-12-09 19:27:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:19,806 INFO L93 Difference]: Finished difference Result 4083 states and 9603 transitions. [2018-12-09 19:27:19,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:27:19,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 19:27:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:19,809 INFO L225 Difference]: With dead ends: 4083 [2018-12-09 19:27:19,809 INFO L226 Difference]: Without dead ends: 4059 [2018-12-09 19:27:19,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:27:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2018-12-09 19:27:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3726. [2018-12-09 19:27:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2018-12-09 19:27:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 8817 transitions. [2018-12-09 19:27:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 8817 transitions. Word has length 102 [2018-12-09 19:27:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:19,854 INFO L480 AbstractCegarLoop]: Abstraction has 3726 states and 8817 transitions. [2018-12-09 19:27:19,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:27:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 8817 transitions. [2018-12-09 19:27:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:27:19,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:19,857 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:27:19,857 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:19,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash -409676059, now seen corresponding path program 1 times [2018-12-09 19:27:19,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:19,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:19,904 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-09 19:27:19,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:19,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:27:19,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:19,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:27:19,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:27:19,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:27:19,905 INFO L87 Difference]: Start difference. First operand 3726 states and 8817 transitions. Second operand 7 states. [2018-12-09 19:27:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:20,058 INFO L93 Difference]: Finished difference Result 4173 states and 9758 transitions. [2018-12-09 19:27:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:27:20,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:27:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:20,061 INFO L225 Difference]: With dead ends: 4173 [2018-12-09 19:27:20,061 INFO L226 Difference]: Without dead ends: 4173 [2018-12-09 19:27:20,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:27:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-12-09 19:27:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 3668. [2018-12-09 19:27:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2018-12-09 19:27:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 8699 transitions. [2018-12-09 19:27:20,086 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 8699 transitions. Word has length 102 [2018-12-09 19:27:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:20,086 INFO L480 AbstractCegarLoop]: Abstraction has 3668 states and 8699 transitions. [2018-12-09 19:27:20,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:27:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 8699 transitions. [2018-12-09 19:27:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:27:20,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:20,088 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:27:20,088 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:20,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1904655584, now seen corresponding path program 1 times [2018-12-09 19:27:20,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:20,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:20,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:20,139 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-09 19:27:20,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:20,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:27:20,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:20,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:27:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:27:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:27:20,140 INFO L87 Difference]: Start difference. First operand 3668 states and 8699 transitions. Second operand 5 states. [2018-12-09 19:27:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:20,163 INFO L93 Difference]: Finished difference Result 3668 states and 8683 transitions. [2018-12-09 19:27:20,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:27:20,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 19:27:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:20,166 INFO L225 Difference]: With dead ends: 3668 [2018-12-09 19:27:20,166 INFO L226 Difference]: Without dead ends: 3668 [2018-12-09 19:27:20,166 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-09 19:27:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2018-12-09 19:27:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3274. [2018-12-09 19:27:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2018-12-09 19:27:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 7771 transitions. [2018-12-09 19:27:20,191 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 7771 transitions. Word has length 102 [2018-12-09 19:27:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:20,191 INFO L480 AbstractCegarLoop]: Abstraction has 3274 states and 7771 transitions. [2018-12-09 19:27:20,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:27:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 7771 transitions. [2018-12-09 19:27:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:27:20,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:20,194 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:27:20,194 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:20,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1017151903, now seen corresponding path program 2 times [2018-12-09 19:27:20,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:20,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:20,302 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-09 19:27:20,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:27:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:27:20,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:27:20,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:27:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:27:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:27:20,303 INFO L87 Difference]: Start difference. First operand 3274 states and 7771 transitions. Second operand 13 states. [2018-12-09 19:27:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:20,685 INFO L93 Difference]: Finished difference Result 5160 states and 12024 transitions. [2018-12-09 19:27:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:27:20,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-09 19:27:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:20,688 INFO L225 Difference]: With dead ends: 5160 [2018-12-09 19:27:20,688 INFO L226 Difference]: Without dead ends: 3780 [2018-12-09 19:27:20,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:27:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2018-12-09 19:27:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3330. [2018-12-09 19:27:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2018-12-09 19:27:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 7833 transitions. [2018-12-09 19:27:20,712 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 7833 transitions. Word has length 102 [2018-12-09 19:27:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:20,712 INFO L480 AbstractCegarLoop]: Abstraction has 3330 states and 7833 transitions. [2018-12-09 19:27:20,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:27:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 7833 transitions. [2018-12-09 19:27:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:27:20,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:20,715 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:27:20,715 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:27:20,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash -604299489, now seen corresponding path program 3 times [2018-12-09 19:27:20,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:27:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:20,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:27:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:27:20,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:27:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:27:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:27:20,766 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:27:20,841 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:27:20,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:27:20 BasicIcfg [2018-12-09 19:27:20,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:27:20,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:27:20,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:27:20,842 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:27:20,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:06" (3/4) ... [2018-12-09 19:27:20,844 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:27:20,918 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a3f98124-6764-4093-b186-5133c610586b/bin-2019/utaipan/witness.graphml [2018-12-09 19:27:20,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:27:20,919 INFO L168 Benchmark]: Toolchain (without parser) took 75531.77 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 947.0 MB in the beginning and 4.8 GB in the end (delta: -3.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-09 19:27:20,920 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:27:20,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:27:20,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.15 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:27:20,920 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:27:20,921 INFO L168 Benchmark]: RCFGBuilder took 369.62 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: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:27:20,921 INFO L168 Benchmark]: TraceAbstraction took 74704.46 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-09 19:27:20,921 INFO L168 Benchmark]: Witness Printer took 76.73 ms. Allocated memory is still 7.2 GB. Free memory was 4.9 GB in the beginning and 4.8 GB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:27:20,922 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.15 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 369.62 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: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74704.46 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 76.73 ms. Allocated memory is still 7.2 GB. Free memory was 4.9 GB in the beginning and 4.8 GB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L786] -1 pthread_t t1777; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L787] FCALL, FORK -1 pthread_create(&t1777, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L788] -1 pthread_t t1778; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L789] FCALL, FORK -1 pthread_create(&t1778, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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 [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 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_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -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) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -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 [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -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 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 74.6s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10270 SDtfs, 12607 SDslu, 25336 SDs, 0 SdLazy, 10059 SolverSat, 621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 71 SyntacticMatches, 27 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229832occurred in iteration=7, 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: 45.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 511276 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2220 NumberOfCodeBlocks, 2220 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2090 ConstructedInterpolants, 0 QuantifiedInterpolants, 436921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...