./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/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 9fe89a4d2a95a491ef7d92e5c5358d7d6e257149 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 21:02:54,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:02:54,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:02:54,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:02:54,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:02:54,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:02:54,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:02:54,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:02:54,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:02:54,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:02:54,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:02:54,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:02:54,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:02:54,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:02:54,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:02:54,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:02:54,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:02:54,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:02:54,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:02:54,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:02:54,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:02:54,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:02:54,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:02:54,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:02:54,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:02:54,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:02:54,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:02:54,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:02:54,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:02:54,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:02:54,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:02:54,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:02:54,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:02:54,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:02:54,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:02:54,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:02:54,102 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 21:02:54,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:02:54,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:02:54,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:02:54,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:02:54,110 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:02:54,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:02:54,110 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:02:54,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:02:54,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:02:54,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:02:54,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:02:54,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:02:54,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:02:54,113 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:02:54,113 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_68d97e32-3b61-48ba-931c-c4a682c61612/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 -> 9fe89a4d2a95a491ef7d92e5c5358d7d6e257149 [2018-12-02 21:02:54,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:02:54,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:02:54,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:02:54,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:02:54,144 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:02:54,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i [2018-12-02 21:02:54,191 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/data/930cb5201/cba9d53e0a4e4525b5a2a44e27c024a3/FLAG09eed98aa [2018-12-02 21:02:54,624 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:02:54,625 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i [2018-12-02 21:02:54,633 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/data/930cb5201/cba9d53e0a4e4525b5a2a44e27c024a3/FLAG09eed98aa [2018-12-02 21:02:54,641 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/data/930cb5201/cba9d53e0a4e4525b5a2a44e27c024a3 [2018-12-02 21:02:54,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:02:54,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:02:54,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:02:54,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:02:54,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:02:54,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:54,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54, skipping insertion in model container [2018-12-02 21:02:54,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:54,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:02:54,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:02:54,851 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:02:54,859 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:02:54,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:02:54,964 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:02:54,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54 WrapperNode [2018-12-02 21:02:54,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:02:54,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:02:54,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:02:54,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:02:54,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:54,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:02:55,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:02:55,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:02:55,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:02:55,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... [2018-12-02 21:02:55,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:02:55,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:02:55,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:02:55,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:02:55,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/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-02 21:02:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:02:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:02:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 21:02:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:02:55,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 21:02:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 21:02:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 21:02:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 21:02:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 21:02:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 21:02:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 21:02:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:02:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:02:55,057 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 21:02:55,383 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:02:55,383 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 21:02:55,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:02:55 BoogieIcfgContainer [2018-12-02 21:02:55,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:02:55,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:02:55,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:02:55,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:02:55,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:02:54" (1/3) ... [2018-12-02 21:02:55,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0dad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:02:55, skipping insertion in model container [2018-12-02 21:02:55,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:02:54" (2/3) ... [2018-12-02 21:02:55,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0dad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:02:55, skipping insertion in model container [2018-12-02 21:02:55,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:02:55" (3/3) ... [2018-12-02 21:02:55,390 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt_false-unreach-call.i [2018-12-02 21:02:55,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,418 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,418 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,420 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,426 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,426 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:02:55,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 21:02:55,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:02:55,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 21:02:55,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 21:02:55,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:02:55,470 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:02:55,470 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:02:55,470 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:02:55,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:02:55,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:02:55,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:02:55,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:02:55,478 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-02 21:03:09,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-02 21:03:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-02 21:03:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 21:03:09,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:09,943 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] [2018-12-02 21:03:09,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:09,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-02 21:03:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:09,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:09,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:09,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:09,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:10,099 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-02 21:03:10,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:10,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:03:10,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:10,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:03:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:03:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:03:10,115 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-02 21:03:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:11,469 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-02 21:03:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:03:11,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 21:03:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:12,254 INFO L225 Difference]: With dead ends: 233471 [2018-12-02 21:03:12,255 INFO L226 Difference]: Without dead ends: 203721 [2018-12-02 21:03:12,256 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-02 21:03:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-02 21:03:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-02 21:03:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 21:03:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-02 21:03:17,315 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-02 21:03:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:17,316 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-02 21:03:17,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:03:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-02 21:03:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:03:17,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:17,324 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-02 21:03:17,325 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:17,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-02 21:03:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:17,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:17,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:17,370 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-02 21:03:17,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:17,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:03:17,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:17,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:03:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:03:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:03:17,372 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-02 21:03:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:17,970 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-02 21:03:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:03:17,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 21:03:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:18,349 INFO L225 Difference]: With dead ends: 118891 [2018-12-02 21:03:18,349 INFO L226 Difference]: Without dead ends: 118891 [2018-12-02 21:03:18,350 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-02 21:03:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-02 21:03:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-02 21:03:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 21:03:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-02 21:03:23,049 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-02 21:03:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:23,049 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-02 21:03:23,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:03:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-02 21:03:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:03:23,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:23,053 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-02 21:03:23,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:23,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-02 21:03:23,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:23,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:23,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:23,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:23,107 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-02 21:03:23,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:23,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:03:23,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:23,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:03:23,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:03:23,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:03:23,108 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-02 21:03:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:25,015 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-02 21:03:25,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:03:25,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 21:03:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:25,832 INFO L225 Difference]: With dead ends: 325271 [2018-12-02 21:03:25,833 INFO L226 Difference]: Without dead ends: 324271 [2018-12-02 21:03:25,833 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-02 21:03:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-02 21:03:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-02 21:03:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-02 21:03:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-02 21:03:30,976 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-02 21:03:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:30,977 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-02 21:03:30,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:03:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-02 21:03:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 21:03:30,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:30,981 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] [2018-12-02 21:03:30,981 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:30,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-02 21:03:30,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:30,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:31,025 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-02 21:03:31,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:31,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:03:31,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:31,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:03:31,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:03:31,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:03:31,026 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-02 21:03:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:31,734 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-02 21:03:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:03:31,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 21:03:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:32,120 INFO L225 Difference]: With dead ends: 163597 [2018-12-02 21:03:32,120 INFO L226 Difference]: Without dead ends: 160992 [2018-12-02 21:03:32,120 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-02 21:03:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-02 21:03:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-02 21:03:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-02 21:03:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-02 21:03:37,384 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-02 21:03:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:37,385 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-02 21:03:37,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:03:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-02 21:03:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 21:03:37,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:37,389 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] [2018-12-02 21:03:37,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:37,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-02 21:03:37,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:37,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:37,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:37,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:37,436 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-02 21:03:37,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:37,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:03:37,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:37,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:03:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:03:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:03:37,437 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-02 21:03:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:39,247 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-02 21:03:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:03:39,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 21:03:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:39,987 INFO L225 Difference]: With dead ends: 289848 [2018-12-02 21:03:39,987 INFO L226 Difference]: Without dead ends: 289008 [2018-12-02 21:03:39,987 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-02 21:03:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-02 21:03:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-02 21:03:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-02 21:03:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-02 21:03:47,590 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-02 21:03:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:47,591 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-02 21:03:47,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:03:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-02 21:03:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:03:47,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:47,612 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] [2018-12-02 21:03:47,612 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:47,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash -252934140, now seen corresponding path program 1 times [2018-12-02 21:03:47,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:47,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:47,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:47,667 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-02 21:03:47,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:47,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:03:47,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:47,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:03:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:03:47,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:03:47,668 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-02 21:03:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:49,320 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-02 21:03:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:03:49,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 21:03:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:50,365 INFO L225 Difference]: With dead ends: 292568 [2018-12-02 21:03:50,365 INFO L226 Difference]: Without dead ends: 291728 [2018-12-02 21:03:50,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:03:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-02 21:03:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-02 21:03:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-02 21:03:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-02 21:03:54,392 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-02 21:03:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:03:54,392 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-02 21:03:54,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:03:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-02 21:03:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 21:03:54,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:03:54,452 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] [2018-12-02 21:03:54,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:03:54,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:03:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-02 21:03:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:03:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:54,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:03:54,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:03:54,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:03:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:03:54,495 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-02 21:03:54,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:03:54,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:03:54,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:03:54,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:03:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:03:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:03:54,495 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-02 21:03:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:03:56,188 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-02 21:03:56,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:03:56,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 21:03:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:03:56,857 INFO L225 Difference]: With dead ends: 264420 [2018-12-02 21:03:56,857 INFO L226 Difference]: Without dead ends: 263060 [2018-12-02 21:03:56,857 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-02 21:03:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-02 21:04:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-02 21:04:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-02 21:04:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-02 21:04:02,210 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-02 21:04:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:02,210 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-02 21:04:02,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:04:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-02 21:04:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 21:04:02,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:02,296 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] [2018-12-02 21:04:02,296 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:02,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-02 21:04:02,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:02,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:02,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:02,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:02,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:02,333 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-02 21:04:02,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:02,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:04:02,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:02,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:04:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:04:02,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:04:02,334 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-02 21:04:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:02,648 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-02 21:04:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:04:02,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 21:04:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:02,802 INFO L225 Difference]: With dead ends: 78044 [2018-12-02 21:04:02,802 INFO L226 Difference]: Without dead ends: 75732 [2018-12-02 21:04:02,802 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-02 21:04:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-02 21:04:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-02 21:04:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-02 21:04:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-02 21:04:05,894 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-02 21:04:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:05,894 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-02 21:04:05,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:04:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-02 21:04:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 21:04:05,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:05,943 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] [2018-12-02 21:04:05,943 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:05,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:05,943 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-02 21:04:05,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:05,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:05,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:05,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:05,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:05,997 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-02 21:04:05,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:04:05,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:05,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:04:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:04:05,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:04:05,998 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-02 21:04:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:06,479 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-02 21:04:06,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:04:06,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 21:04:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:06,702 INFO L225 Difference]: With dead ends: 105528 [2018-12-02 21:04:06,702 INFO L226 Difference]: Without dead ends: 105528 [2018-12-02 21:04:06,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:04:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-02 21:04:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-02 21:04:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-02 21:04:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-02 21:04:08,129 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-02 21:04:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:08,129 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-02 21:04:08,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:04:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-02 21:04:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 21:04:08,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:08,185 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] [2018-12-02 21:04:08,185 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:08,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-02 21:04:08,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:08,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:08,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:08,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:08,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:08,224 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-02 21:04:08,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:08,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:04:08,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:04:08,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:04:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:04:08,225 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-02 21:04:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:08,993 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-02 21:04:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:04:08,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 21:04:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:09,225 INFO L225 Difference]: With dead ends: 113667 [2018-12-02 21:04:09,226 INFO L226 Difference]: Without dead ends: 113667 [2018-12-02 21:04:09,226 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-02 21:04:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-02 21:04:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-02 21:04:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-02 21:04:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-02 21:04:10,998 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-02 21:04:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:10,999 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-02 21:04:10,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:04:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-02 21:04:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 21:04:11,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:11,073 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] [2018-12-02 21:04:11,073 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:11,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-02 21:04:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:11,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:11,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:11,162 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-02 21:04:11,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:11,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:04:11,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:11,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:04:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:04:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:11,163 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-12-02 21:04:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:12,436 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-12-02 21:04:12,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:04:12,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-02 21:04:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:12,753 INFO L225 Difference]: With dead ends: 155234 [2018-12-02 21:04:12,753 INFO L226 Difference]: Without dead ends: 154210 [2018-12-02 21:04:12,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:04:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-12-02 21:04:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-12-02 21:04:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-12-02 21:04:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-12-02 21:04:14,847 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-12-02 21:04:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:14,847 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-12-02 21:04:14,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:04:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-12-02 21:04:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 21:04:14,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:14,933 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] [2018-12-02 21:04:14,934 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:14,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:14,934 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-12-02 21:04:14,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:14,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:14,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:14,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:15,012 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-02 21:04:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:15,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:15,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:15,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:15,014 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-12-02 21:04:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:15,844 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-12-02 21:04:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:04:15,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 21:04:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:16,087 INFO L225 Difference]: With dead ends: 124463 [2018-12-02 21:04:16,087 INFO L226 Difference]: Without dead ends: 124463 [2018-12-02 21:04:16,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-12-02 21:04:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-12-02 21:04:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-12-02 21:04:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-12-02 21:04:18,127 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-12-02 21:04:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:18,127 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-12-02 21:04:18,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-12-02 21:04:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 21:04:18,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:18,212 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] [2018-12-02 21:04:18,212 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:18,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-12-02 21:04:18,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:18,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:18,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:18,250 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-02 21:04:18,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:18,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:18,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:18,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:18,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:18,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:18,251 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 7 states. [2018-12-02 21:04:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:19,189 INFO L93 Difference]: Finished difference Result 141948 states and 558974 transitions. [2018-12-02 21:04:19,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:04:19,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-12-02 21:04:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:19,482 INFO L225 Difference]: With dead ends: 141948 [2018-12-02 21:04:19,482 INFO L226 Difference]: Without dead ends: 141628 [2018-12-02 21:04:19,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:04:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141628 states. [2018-12-02 21:04:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141628 to 125100. [2018-12-02 21:04:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125100 states. [2018-12-02 21:04:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125100 states to 125100 states and 493478 transitions. [2018-12-02 21:04:21,562 INFO L78 Accepts]: Start accepts. Automaton has 125100 states and 493478 transitions. Word has length 78 [2018-12-02 21:04:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 125100 states and 493478 transitions. [2018-12-02 21:04:21,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 125100 states and 493478 transitions. [2018-12-02 21:04:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 21:04:21,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:21,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:04:21,667 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:21,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1971879058, now seen corresponding path program 1 times [2018-12-02 21:04:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:21,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:21,688 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-02 21:04:21,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:21,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:04:21,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:21,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:04:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:04:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:04:21,689 INFO L87 Difference]: Start difference. First operand 125100 states and 493478 transitions. Second operand 3 states. [2018-12-02 21:04:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:22,284 INFO L93 Difference]: Finished difference Result 144460 states and 564710 transitions. [2018-12-02 21:04:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:04:22,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-02 21:04:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:22,824 INFO L225 Difference]: With dead ends: 144460 [2018-12-02 21:04:22,824 INFO L226 Difference]: Without dead ends: 144460 [2018-12-02 21:04:22,825 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-02 21:04:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144460 states. [2018-12-02 21:04:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144460 to 131356. [2018-12-02 21:04:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131356 states. [2018-12-02 21:04:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131356 states to 131356 states and 515998 transitions. [2018-12-02 21:04:25,013 INFO L78 Accepts]: Start accepts. Automaton has 131356 states and 515998 transitions. Word has length 80 [2018-12-02 21:04:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:25,013 INFO L480 AbstractCegarLoop]: Abstraction has 131356 states and 515998 transitions. [2018-12-02 21:04:25,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:04:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 131356 states and 515998 transitions. [2018-12-02 21:04:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 21:04:25,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:25,131 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] [2018-12-02 21:04:25,131 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:25,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1138385650, now seen corresponding path program 1 times [2018-12-02 21:04:25,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:25,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:25,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:25,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:25,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:25,202 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-02 21:04:25,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:25,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:04:25,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:25,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:04:25,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:04:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:25,203 INFO L87 Difference]: Start difference. First operand 131356 states and 515998 transitions. Second operand 8 states. [2018-12-02 21:04:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:26,366 INFO L93 Difference]: Finished difference Result 149612 states and 583830 transitions. [2018-12-02 21:04:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 21:04:26,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-02 21:04:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:26,695 INFO L225 Difference]: With dead ends: 149612 [2018-12-02 21:04:26,695 INFO L226 Difference]: Without dead ends: 149292 [2018-12-02 21:04:26,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-02 21:04:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149292 states. [2018-12-02 21:04:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149292 to 134300. [2018-12-02 21:04:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134300 states. [2018-12-02 21:04:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134300 states to 134300 states and 528142 transitions. [2018-12-02 21:04:29,289 INFO L78 Accepts]: Start accepts. Automaton has 134300 states and 528142 transitions. Word has length 84 [2018-12-02 21:04:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:29,289 INFO L480 AbstractCegarLoop]: Abstraction has 134300 states and 528142 transitions. [2018-12-02 21:04:29,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:04:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 134300 states and 528142 transitions. [2018-12-02 21:04:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 21:04:29,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:29,423 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] [2018-12-02 21:04:29,423 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:29,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -827137735, now seen corresponding path program 1 times [2018-12-02 21:04:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:29,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:29,461 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-02 21:04:29,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:29,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:04:29,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:29,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:04:29,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:04:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:04:29,462 INFO L87 Difference]: Start difference. First operand 134300 states and 528142 transitions. Second operand 4 states. [2018-12-02 21:04:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:30,219 INFO L93 Difference]: Finished difference Result 159012 states and 618564 transitions. [2018-12-02 21:04:30,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:04:30,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-02 21:04:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:30,553 INFO L225 Difference]: With dead ends: 159012 [2018-12-02 21:04:30,554 INFO L226 Difference]: Without dead ends: 158052 [2018-12-02 21:04:30,554 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-02 21:04:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158052 states. [2018-12-02 21:04:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158052 to 151252. [2018-12-02 21:04:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151252 states. [2018-12-02 21:04:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151252 states to 151252 states and 590508 transitions. [2018-12-02 21:04:33,018 INFO L78 Accepts]: Start accepts. Automaton has 151252 states and 590508 transitions. Word has length 86 [2018-12-02 21:04:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:33,019 INFO L480 AbstractCegarLoop]: Abstraction has 151252 states and 590508 transitions. [2018-12-02 21:04:33,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:04:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 151252 states and 590508 transitions. [2018-12-02 21:04:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 21:04:33,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:33,481 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] [2018-12-02 21:04:33,481 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:33,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1532169274, now seen corresponding path program 1 times [2018-12-02 21:04:33,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:33,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:33,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:33,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:33,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:33,517 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-02 21:04:33,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:33,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:04:33,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:33,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:04:33,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:04:33,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:04:33,518 INFO L87 Difference]: Start difference. First operand 151252 states and 590508 transitions. Second operand 3 states. [2018-12-02 21:04:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:34,266 INFO L93 Difference]: Finished difference Result 159356 states and 620840 transitions. [2018-12-02 21:04:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:04:34,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-02 21:04:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:34,606 INFO L225 Difference]: With dead ends: 159356 [2018-12-02 21:04:34,606 INFO L226 Difference]: Without dead ends: 159356 [2018-12-02 21:04:34,606 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-02 21:04:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159356 states. [2018-12-02 21:04:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159356 to 155280. [2018-12-02 21:04:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155280 states. [2018-12-02 21:04:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155280 states to 155280 states and 605540 transitions. [2018-12-02 21:04:37,058 INFO L78 Accepts]: Start accepts. Automaton has 155280 states and 605540 transitions. Word has length 86 [2018-12-02 21:04:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:37,059 INFO L480 AbstractCegarLoop]: Abstraction has 155280 states and 605540 transitions. [2018-12-02 21:04:37,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:04:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 155280 states and 605540 transitions. [2018-12-02 21:04:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 21:04:37,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:37,563 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] [2018-12-02 21:04:37,563 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:37,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:37,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1381420627, now seen corresponding path program 1 times [2018-12-02 21:04:37,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:37,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:37,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:37,613 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-02 21:04:37,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:37,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:37,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:37,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:37,613 INFO L87 Difference]: Start difference. First operand 155280 states and 605540 transitions. Second operand 6 states. [2018-12-02 21:04:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:38,574 INFO L93 Difference]: Finished difference Result 163731 states and 634865 transitions. [2018-12-02 21:04:38,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:04:38,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 21:04:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:38,915 INFO L225 Difference]: With dead ends: 163731 [2018-12-02 21:04:38,915 INFO L226 Difference]: Without dead ends: 163731 [2018-12-02 21:04:38,915 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-02 21:04:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163731 states. [2018-12-02 21:04:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163731 to 154129. [2018-12-02 21:04:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154129 states. [2018-12-02 21:04:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154129 states to 154129 states and 601338 transitions. [2018-12-02 21:04:41,388 INFO L78 Accepts]: Start accepts. Automaton has 154129 states and 601338 transitions. Word has length 87 [2018-12-02 21:04:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:41,388 INFO L480 AbstractCegarLoop]: Abstraction has 154129 states and 601338 transitions. [2018-12-02 21:04:41,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 154129 states and 601338 transitions. [2018-12-02 21:04:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 21:04:41,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:41,940 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] [2018-12-02 21:04:41,940 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:41,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash 977886382, now seen corresponding path program 1 times [2018-12-02 21:04:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:41,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:41,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:41,994 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-02 21:04:41,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:41,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:41,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:41,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:41,995 INFO L87 Difference]: Start difference. First operand 154129 states and 601338 transitions. Second operand 7 states. [2018-12-02 21:04:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:42,913 INFO L93 Difference]: Finished difference Result 161961 states and 627602 transitions. [2018-12-02 21:04:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:04:42,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-02 21:04:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:43,252 INFO L225 Difference]: With dead ends: 161961 [2018-12-02 21:04:43,252 INFO L226 Difference]: Without dead ends: 161961 [2018-12-02 21:04:43,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:04:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161961 states. [2018-12-02 21:04:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161961 to 149344. [2018-12-02 21:04:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149344 states. [2018-12-02 21:04:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149344 states to 149344 states and 581991 transitions. [2018-12-02 21:04:45,695 INFO L78 Accepts]: Start accepts. Automaton has 149344 states and 581991 transitions. Word has length 87 [2018-12-02 21:04:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:45,695 INFO L480 AbstractCegarLoop]: Abstraction has 149344 states and 581991 transitions. [2018-12-02 21:04:45,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 149344 states and 581991 transitions. [2018-12-02 21:04:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 21:04:45,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:45,870 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] [2018-12-02 21:04:45,870 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:45,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1307652143, now seen corresponding path program 1 times [2018-12-02 21:04:45,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:45,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:45,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:45,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:45,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:45,907 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-02 21:04:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:45,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:45,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:45,908 INFO L87 Difference]: Start difference. First operand 149344 states and 581991 transitions. Second operand 6 states. [2018-12-02 21:04:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:46,196 INFO L93 Difference]: Finished difference Result 24944 states and 82271 transitions. [2018-12-02 21:04:46,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:04:46,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 21:04:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:46,221 INFO L225 Difference]: With dead ends: 24944 [2018-12-02 21:04:46,221 INFO L226 Difference]: Without dead ends: 20548 [2018-12-02 21:04:46,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:04:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2018-12-02 21:04:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 19468. [2018-12-02 21:04:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19468 states. [2018-12-02 21:04:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19468 states to 19468 states and 64369 transitions. [2018-12-02 21:04:46,422 INFO L78 Accepts]: Start accepts. Automaton has 19468 states and 64369 transitions. Word has length 87 [2018-12-02 21:04:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:46,423 INFO L480 AbstractCegarLoop]: Abstraction has 19468 states and 64369 transitions. [2018-12-02 21:04:46,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 19468 states and 64369 transitions. [2018-12-02 21:04:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 21:04:46,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:46,437 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] [2018-12-02 21:04:46,437 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:46,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-12-02 21:04:46,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:46,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:46,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:46,481 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-02 21:04:46,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:46,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:46,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:46,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:46,482 INFO L87 Difference]: Start difference. First operand 19468 states and 64369 transitions. Second operand 6 states. [2018-12-02 21:04:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:46,645 INFO L93 Difference]: Finished difference Result 22458 states and 72381 transitions. [2018-12-02 21:04:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:04:46,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-02 21:04:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:46,669 INFO L225 Difference]: With dead ends: 22458 [2018-12-02 21:04:46,669 INFO L226 Difference]: Without dead ends: 22458 [2018-12-02 21:04:46,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:04:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2018-12-02 21:04:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 20353. [2018-12-02 21:04:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20353 states. [2018-12-02 21:04:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20353 states to 20353 states and 66492 transitions. [2018-12-02 21:04:46,879 INFO L78 Accepts]: Start accepts. Automaton has 20353 states and 66492 transitions. Word has length 97 [2018-12-02 21:04:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:46,879 INFO L480 AbstractCegarLoop]: Abstraction has 20353 states and 66492 transitions. [2018-12-02 21:04:46,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 20353 states and 66492 transitions. [2018-12-02 21:04:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 21:04:46,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:46,894 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] [2018-12-02 21:04:46,894 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:46,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-12-02 21:04:46,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:46,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:46,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:46,939 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-02 21:04:46,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:04:46,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:46,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:04:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:04:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:04:46,940 INFO L87 Difference]: Start difference. First operand 20353 states and 66492 transitions. Second operand 5 states. [2018-12-02 21:04:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:47,101 INFO L93 Difference]: Finished difference Result 24276 states and 78291 transitions. [2018-12-02 21:04:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:04:47,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 21:04:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:47,128 INFO L225 Difference]: With dead ends: 24276 [2018-12-02 21:04:47,128 INFO L226 Difference]: Without dead ends: 23991 [2018-12-02 21:04:47,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23991 states. [2018-12-02 21:04:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23991 to 20833. [2018-12-02 21:04:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2018-12-02 21:04:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 67896 transitions. [2018-12-02 21:04:47,360 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 67896 transitions. Word has length 97 [2018-12-02 21:04:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:47,360 INFO L480 AbstractCegarLoop]: Abstraction has 20833 states and 67896 transitions. [2018-12-02 21:04:47,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:04:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 67896 transitions. [2018-12-02 21:04:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:47,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:47,375 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] [2018-12-02 21:04:47,376 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:47,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-12-02 21:04:47,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:47,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:47,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:47,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:47,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:47,429 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-02 21:04:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:47,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 21:04:47,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:47,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:04:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:04:47,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:04:47,430 INFO L87 Difference]: Start difference. First operand 20833 states and 67896 transitions. Second operand 9 states. [2018-12-02 21:04:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:47,944 INFO L93 Difference]: Finished difference Result 37316 states and 119621 transitions. [2018-12-02 21:04:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 21:04:47,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-02 21:04:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:47,985 INFO L225 Difference]: With dead ends: 37316 [2018-12-02 21:04:47,986 INFO L226 Difference]: Without dead ends: 37188 [2018-12-02 21:04:47,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:04:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2018-12-02 21:04:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 23941. [2018-12-02 21:04:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23941 states. [2018-12-02 21:04:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23941 states to 23941 states and 77975 transitions. [2018-12-02 21:04:48,312 INFO L78 Accepts]: Start accepts. Automaton has 23941 states and 77975 transitions. Word has length 99 [2018-12-02 21:04:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:48,312 INFO L480 AbstractCegarLoop]: Abstraction has 23941 states and 77975 transitions. [2018-12-02 21:04:48,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:04:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23941 states and 77975 transitions. [2018-12-02 21:04:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:48,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:48,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:04:48,330 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:48,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-12-02 21:04:48,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:48,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:48,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:48,392 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-02 21:04:48,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:48,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:48,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:48,392 INFO L87 Difference]: Start difference. First operand 23941 states and 77975 transitions. Second operand 7 states. [2018-12-02 21:04:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:48,779 INFO L93 Difference]: Finished difference Result 36707 states and 119676 transitions. [2018-12-02 21:04:48,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:04:48,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 21:04:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:48,821 INFO L225 Difference]: With dead ends: 36707 [2018-12-02 21:04:48,821 INFO L226 Difference]: Without dead ends: 36332 [2018-12-02 21:04:48,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:04:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36332 states. [2018-12-02 21:04:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36332 to 23996. [2018-12-02 21:04:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23996 states. [2018-12-02 21:04:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23996 states to 23996 states and 77959 transitions. [2018-12-02 21:04:49,134 INFO L78 Accepts]: Start accepts. Automaton has 23996 states and 77959 transitions. Word has length 99 [2018-12-02 21:04:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:49,134 INFO L480 AbstractCegarLoop]: Abstraction has 23996 states and 77959 transitions. [2018-12-02 21:04:49,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 23996 states and 77959 transitions. [2018-12-02 21:04:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:49,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:49,155 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] [2018-12-02 21:04:49,155 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:49,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-12-02 21:04:49,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:49,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:49,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:49,216 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-02 21:04:49,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:49,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:49,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:49,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:49,217 INFO L87 Difference]: Start difference. First operand 23996 states and 77959 transitions. Second operand 6 states. [2018-12-02 21:04:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:49,346 INFO L93 Difference]: Finished difference Result 19682 states and 64219 transitions. [2018-12-02 21:04:49,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:04:49,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 21:04:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:49,368 INFO L225 Difference]: With dead ends: 19682 [2018-12-02 21:04:49,368 INFO L226 Difference]: Without dead ends: 19682 [2018-12-02 21:04:49,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19682 states. [2018-12-02 21:04:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19682 to 18282. [2018-12-02 21:04:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2018-12-02 21:04:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 60069 transitions. [2018-12-02 21:04:49,555 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 60069 transitions. Word has length 99 [2018-12-02 21:04:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:49,555 INFO L480 AbstractCegarLoop]: Abstraction has 18282 states and 60069 transitions. [2018-12-02 21:04:49,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 60069 transitions. [2018-12-02 21:04:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:49,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:49,570 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] [2018-12-02 21:04:49,570 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:49,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash 881084081, now seen corresponding path program 1 times [2018-12-02 21:04:49,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:49,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:49,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:49,619 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-02 21:04:49,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:49,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:49,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:49,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:49,620 INFO L87 Difference]: Start difference. First operand 18282 states and 60069 transitions. Second operand 7 states. [2018-12-02 21:04:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:49,927 INFO L93 Difference]: Finished difference Result 20346 states and 66293 transitions. [2018-12-02 21:04:49,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:04:49,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 21:04:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:49,956 INFO L225 Difference]: With dead ends: 20346 [2018-12-02 21:04:49,956 INFO L226 Difference]: Without dead ends: 20346 [2018-12-02 21:04:49,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20346 states. [2018-12-02 21:04:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20346 to 18677. [2018-12-02 21:04:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18677 states. [2018-12-02 21:04:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18677 states to 18677 states and 61180 transitions. [2018-12-02 21:04:50,147 INFO L78 Accepts]: Start accepts. Automaton has 18677 states and 61180 transitions. Word has length 99 [2018-12-02 21:04:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:50,147 INFO L480 AbstractCegarLoop]: Abstraction has 18677 states and 61180 transitions. [2018-12-02 21:04:50,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 18677 states and 61180 transitions. [2018-12-02 21:04:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:50,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:50,162 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] [2018-12-02 21:04:50,163 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:50,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -302263216, now seen corresponding path program 1 times [2018-12-02 21:04:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:50,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:50,239 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-02 21:04:50,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:50,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:04:50,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:50,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:04:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:04:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:50,240 INFO L87 Difference]: Start difference. First operand 18677 states and 61180 transitions. Second operand 8 states. [2018-12-02 21:04:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:50,524 INFO L93 Difference]: Finished difference Result 23880 states and 77548 transitions. [2018-12-02 21:04:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:04:50,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-02 21:04:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:50,548 INFO L225 Difference]: With dead ends: 23880 [2018-12-02 21:04:50,548 INFO L226 Difference]: Without dead ends: 23752 [2018-12-02 21:04:50,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:04:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23752 states. [2018-12-02 21:04:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23752 to 19006. [2018-12-02 21:04:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19006 states. [2018-12-02 21:04:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19006 states to 19006 states and 61979 transitions. [2018-12-02 21:04:50,761 INFO L78 Accepts]: Start accepts. Automaton has 19006 states and 61979 transitions. Word has length 99 [2018-12-02 21:04:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:50,762 INFO L480 AbstractCegarLoop]: Abstraction has 19006 states and 61979 transitions. [2018-12-02 21:04:50,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:04:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19006 states and 61979 transitions. [2018-12-02 21:04:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:50,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:50,776 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] [2018-12-02 21:04:50,776 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:50,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash 659350801, now seen corresponding path program 1 times [2018-12-02 21:04:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:50,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:50,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:50,823 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-02 21:04:50,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:50,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:50,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:50,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:50,824 INFO L87 Difference]: Start difference. First operand 19006 states and 61979 transitions. Second operand 7 states. [2018-12-02 21:04:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:51,029 INFO L93 Difference]: Finished difference Result 24317 states and 78794 transitions. [2018-12-02 21:04:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:04:51,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 21:04:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:51,055 INFO L225 Difference]: With dead ends: 24317 [2018-12-02 21:04:51,055 INFO L226 Difference]: Without dead ends: 24317 [2018-12-02 21:04:51,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:04:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2018-12-02 21:04:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 20388. [2018-12-02 21:04:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20388 states. [2018-12-02 21:04:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20388 states to 20388 states and 66547 transitions. [2018-12-02 21:04:51,275 INFO L78 Accepts]: Start accepts. Automaton has 20388 states and 66547 transitions. Word has length 99 [2018-12-02 21:04:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:51,275 INFO L480 AbstractCegarLoop]: Abstraction has 20388 states and 66547 transitions. [2018-12-02 21:04:51,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 20388 states and 66547 transitions. [2018-12-02 21:04:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:51,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:51,290 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] [2018-12-02 21:04:51,290 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:51,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:51,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1904115282, now seen corresponding path program 1 times [2018-12-02 21:04:51,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:51,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:51,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:51,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:51,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:51,337 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-02 21:04:51,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:51,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:51,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:51,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:51,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:51,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:51,338 INFO L87 Difference]: Start difference. First operand 20388 states and 66547 transitions. Second operand 6 states. [2018-12-02 21:04:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:51,442 INFO L93 Difference]: Finished difference Result 33572 states and 111666 transitions. [2018-12-02 21:04:51,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:04:51,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 21:04:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:51,483 INFO L225 Difference]: With dead ends: 33572 [2018-12-02 21:04:51,483 INFO L226 Difference]: Without dead ends: 33572 [2018-12-02 21:04:51,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33572 states. [2018-12-02 21:04:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33572 to 20248. [2018-12-02 21:04:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20248 states. [2018-12-02 21:04:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20248 states to 20248 states and 66055 transitions. [2018-12-02 21:04:51,753 INFO L78 Accepts]: Start accepts. Automaton has 20248 states and 66055 transitions. Word has length 99 [2018-12-02 21:04:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:51,753 INFO L480 AbstractCegarLoop]: Abstraction has 20248 states and 66055 transitions. [2018-12-02 21:04:51,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20248 states and 66055 transitions. [2018-12-02 21:04:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:51,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:51,770 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] [2018-12-02 21:04:51,770 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:51,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash 83704689, now seen corresponding path program 1 times [2018-12-02 21:04:51,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:51,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:51,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:51,819 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-02 21:04:51,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:51,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:04:51,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:51,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:04:51,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:04:51,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:04:51,820 INFO L87 Difference]: Start difference. First operand 20248 states and 66055 transitions. Second operand 5 states. [2018-12-02 21:04:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:51,903 INFO L93 Difference]: Finished difference Result 30815 states and 102136 transitions. [2018-12-02 21:04:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:04:51,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 21:04:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:51,940 INFO L225 Difference]: With dead ends: 30815 [2018-12-02 21:04:51,940 INFO L226 Difference]: Without dead ends: 30815 [2018-12-02 21:04:51,940 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-02 21:04:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30815 states. [2018-12-02 21:04:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30815 to 18556. [2018-12-02 21:04:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18556 states. [2018-12-02 21:04:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18556 states to 18556 states and 60184 transitions. [2018-12-02 21:04:52,239 INFO L78 Accepts]: Start accepts. Automaton has 18556 states and 60184 transitions. Word has length 99 [2018-12-02 21:04:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:52,239 INFO L480 AbstractCegarLoop]: Abstraction has 18556 states and 60184 transitions. [2018-12-02 21:04:52,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:04:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18556 states and 60184 transitions. [2018-12-02 21:04:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 21:04:52,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:52,253 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] [2018-12-02 21:04:52,253 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:52,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash 564421105, now seen corresponding path program 1 times [2018-12-02 21:04:52,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:52,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:52,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:52,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:52,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:52,304 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-02 21:04:52,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:52,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:04:52,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:52,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:04:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:04:52,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:04:52,305 INFO L87 Difference]: Start difference. First operand 18556 states and 60184 transitions. Second operand 6 states. [2018-12-02 21:04:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:52,410 INFO L93 Difference]: Finished difference Result 17084 states and 54568 transitions. [2018-12-02 21:04:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:04:52,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 21:04:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:52,427 INFO L225 Difference]: With dead ends: 17084 [2018-12-02 21:04:52,427 INFO L226 Difference]: Without dead ends: 17084 [2018-12-02 21:04:52,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:04:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17084 states. [2018-12-02 21:04:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17084 to 13763. [2018-12-02 21:04:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13763 states. [2018-12-02 21:04:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 44839 transitions. [2018-12-02 21:04:52,578 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 44839 transitions. Word has length 99 [2018-12-02 21:04:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:52,579 INFO L480 AbstractCegarLoop]: Abstraction has 13763 states and 44839 transitions. [2018-12-02 21:04:52,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:04:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 44839 transitions. [2018-12-02 21:04:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 21:04:52,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:52,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, 1] [2018-12-02 21:04:52,589 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:52,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-02 21:04:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:52,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:52,627 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-02 21:04:52,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:52,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:04:52,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:52,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:04:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:04:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:04:52,627 INFO L87 Difference]: Start difference. First operand 13763 states and 44839 transitions. Second operand 5 states. [2018-12-02 21:04:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:52,762 INFO L93 Difference]: Finished difference Result 15555 states and 50599 transitions. [2018-12-02 21:04:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:04:52,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 21:04:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:52,779 INFO L225 Difference]: With dead ends: 15555 [2018-12-02 21:04:52,779 INFO L226 Difference]: Without dead ends: 15427 [2018-12-02 21:04:52,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15427 states. [2018-12-02 21:04:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15427 to 12987. [2018-12-02 21:04:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12987 states. [2018-12-02 21:04:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 42344 transitions. [2018-12-02 21:04:52,922 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 42344 transitions. Word has length 101 [2018-12-02 21:04:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:52,922 INFO L480 AbstractCegarLoop]: Abstraction has 12987 states and 42344 transitions. [2018-12-02 21:04:52,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:04:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 42344 transitions. [2018-12-02 21:04:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 21:04:52,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:52,932 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] [2018-12-02 21:04:52,932 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:52,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-02 21:04:52,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:52,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:52,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:52,997 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-02 21:04:52,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:52,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:52,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:52,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:52,997 INFO L87 Difference]: Start difference. First operand 12987 states and 42344 transitions. Second operand 7 states. [2018-12-02 21:04:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:53,194 INFO L93 Difference]: Finished difference Result 24747 states and 81100 transitions. [2018-12-02 21:04:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:04:53,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 21:04:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:53,209 INFO L225 Difference]: With dead ends: 24747 [2018-12-02 21:04:53,209 INFO L226 Difference]: Without dead ends: 12587 [2018-12-02 21:04:53,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:04:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12587 states. [2018-12-02 21:04:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12587 to 12327. [2018-12-02 21:04:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12327 states. [2018-12-02 21:04:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12327 states to 12327 states and 40424 transitions. [2018-12-02 21:04:53,336 INFO L78 Accepts]: Start accepts. Automaton has 12327 states and 40424 transitions. Word has length 101 [2018-12-02 21:04:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:53,336 INFO L480 AbstractCegarLoop]: Abstraction has 12327 states and 40424 transitions. [2018-12-02 21:04:53,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 12327 states and 40424 transitions. [2018-12-02 21:04:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 21:04:53,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:53,345 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] [2018-12-02 21:04:53,346 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:53,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:53,346 INFO L82 PathProgramCache]: Analyzing trace with hash -671833209, now seen corresponding path program 2 times [2018-12-02 21:04:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:53,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:04:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:53,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:53,413 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-02 21:04:53,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:04:53,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:53,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:04:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:04:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:04:53,414 INFO L87 Difference]: Start difference. First operand 12327 states and 40424 transitions. Second operand 7 states. [2018-12-02 21:04:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:53,622 INFO L93 Difference]: Finished difference Result 20447 states and 67590 transitions. [2018-12-02 21:04:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:04:53,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 21:04:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:53,632 INFO L225 Difference]: With dead ends: 20447 [2018-12-02 21:04:53,632 INFO L226 Difference]: Without dead ends: 8160 [2018-12-02 21:04:53,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:04:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8160 states. [2018-12-02 21:04:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8160 to 8160. [2018-12-02 21:04:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8160 states. [2018-12-02 21:04:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 27269 transitions. [2018-12-02 21:04:53,713 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 27269 transitions. Word has length 101 [2018-12-02 21:04:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:53,713 INFO L480 AbstractCegarLoop]: Abstraction has 8160 states and 27269 transitions. [2018-12-02 21:04:53,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:04:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 27269 transitions. [2018-12-02 21:04:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 21:04:53,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:53,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 21:04:53,719 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:53,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1490274765, now seen corresponding path program 3 times [2018-12-02 21:04:53,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:53,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:04:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:53,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:04:53,798 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-02 21:04:53,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:04:53,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:04:53,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:04:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:04:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:04:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:04:53,798 INFO L87 Difference]: Start difference. First operand 8160 states and 27269 transitions. Second operand 12 states. [2018-12-02 21:04:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:04:54,181 INFO L93 Difference]: Finished difference Result 15532 states and 52246 transitions. [2018-12-02 21:04:54,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 21:04:54,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-02 21:04:54,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:04:54,192 INFO L225 Difference]: With dead ends: 15532 [2018-12-02 21:04:54,193 INFO L226 Difference]: Without dead ends: 10988 [2018-12-02 21:04:54,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:04:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10988 states. [2018-12-02 21:04:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10988 to 10308. [2018-12-02 21:04:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10308 states. [2018-12-02 21:04:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10308 states to 10308 states and 33872 transitions. [2018-12-02 21:04:54,294 INFO L78 Accepts]: Start accepts. Automaton has 10308 states and 33872 transitions. Word has length 101 [2018-12-02 21:04:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:04:54,294 INFO L480 AbstractCegarLoop]: Abstraction has 10308 states and 33872 transitions. [2018-12-02 21:04:54,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:04:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10308 states and 33872 transitions. [2018-12-02 21:04:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 21:04:54,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:04:54,302 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] [2018-12-02 21:04:54,302 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:04:54,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:04:54,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1680924215, now seen corresponding path program 4 times [2018-12-02 21:04:54,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:04:54,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:54,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:04:54,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:04:54,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:04:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:04:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:04:54,339 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:04:54,406 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 21:04:54,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:04:54 BasicIcfg [2018-12-02 21:04:54,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:04:54,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:04:54,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:04:54,408 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:04:54,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:02:55" (3/4) ... [2018-12-02 21:04:54,409 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:04:54,491 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68d97e32-3b61-48ba-931c-c4a682c61612/bin-2019/utaipan/witness.graphml [2018-12-02 21:04:54,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:04:54,491 INFO L168 Benchmark]: Toolchain (without parser) took 119848.63 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.8 GB). Free memory was 947.0 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-02 21:04:54,492 INFO L168 Benchmark]: CDTParser took 0.16 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-02 21:04:54,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:04:54,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:04:54,493 INFO L168 Benchmark]: Boogie Preprocessor took 20.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:04:54,493 INFO L168 Benchmark]: RCFGBuilder took 362.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:04:54,493 INFO L168 Benchmark]: TraceAbstraction took 119022.98 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-02 21:04:54,493 INFO L168 Benchmark]: Witness Printer took 83.51 ms. Allocated memory is still 7.8 GB. Free memory was 3.2 GB in the beginning and 4.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 877.4 kB. Max. memory is 11.5 GB. [2018-12-02 21:04:54,494 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.16 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 321.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 362.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119022.98 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 83.51 ms. Allocated memory is still 7.8 GB. Free memory was 3.2 GB in the beginning and 4.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 877.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L696] -1 int z = 0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] -1 pthread_t t2506; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] FCALL, FORK -1 pthread_create(&t2506, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t2507; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t2507, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2508; VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2508, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L725] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -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) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L787] -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 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -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 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 118.9s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9656 SDtfs, 10139 SDslu, 23593 SDs, 0 SdLazy, 9319 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 111 SyntacticMatches, 25 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred 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: 67.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 750208 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3006 NumberOfCodeBlocks, 3006 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2870 ConstructedInterpolants, 0 QuantifiedInterpolants, 620999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...