./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.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_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/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 11fa2b8d910d21555da4623eb76d0ce1a4371d15 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:37:14,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:37:14,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:37:14,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:37:14,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:37:14,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:37:14,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:37:14,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:37:14,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:37:14,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:37:14,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:37:14,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:37:14,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:37:14,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:37:14,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:37:14,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:37:14,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:37:14,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:37:14,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:37:14,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:37:14,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:37:14,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:37:14,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:37:14,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:37:14,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:37:14,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:37:14,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:37:14,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:37:14,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:37:14,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:37:14,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:37:14,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:37:14,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:37:14,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:37:14,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:37:14,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:37:14,818 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:37:14,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:37:14,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:37:14,825 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:37:14,825 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:37:14,826 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:37:14,826 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:37:14,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:37:14,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:37:14,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:37:14,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:37:14,828 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:37:14,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:37:14,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:37:14,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:37:14,829 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_daea1534-c5bf-4b9d-b2ab-b73106824cc3/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 -> 11fa2b8d910d21555da4623eb76d0ce1a4371d15 [2018-12-02 05:37:14,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:37:14,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:37:14,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:37:14,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:37:14,860 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:37:14,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i [2018-12-02 05:37:14,896 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/data/dfde5f9bd/3bdba0c958174b349b447bf07424941b/FLAG687846794 [2018-12-02 05:37:15,288 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:37:15,289 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/sv-benchmarks/c/pthread-wmm/mix056_power.opt_false-unreach-call.i [2018-12-02 05:37:15,295 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/data/dfde5f9bd/3bdba0c958174b349b447bf07424941b/FLAG687846794 [2018-12-02 05:37:15,627 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/data/dfde5f9bd/3bdba0c958174b349b447bf07424941b [2018-12-02 05:37:15,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:37:15,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:37:15,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:37:15,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:37:15,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:37:15,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:15,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190a4d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15, skipping insertion in model container [2018-12-02 05:37:15,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:15,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:37:15,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:37:15,880 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:37:15,889 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:37:15,969 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:37:15,998 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:37:15,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15 WrapperNode [2018-12-02 05:37:15,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:37:15,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:37:15,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:37:15,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:37:16,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:37:16,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:37:16,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:37:16,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:37:16,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... [2018-12-02 05:37:16,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:37:16,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:37:16,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:37:16,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:37:16,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/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 05:37:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 05:37:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 05:37:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 05:37:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 05:37:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:37:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:37:16,087 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 05:37:16,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:37:16,391 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 05:37:16,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:16 BoogieIcfgContainer [2018-12-02 05:37:16,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:37:16,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:37:16,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:37:16,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:37:16,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:37:15" (1/3) ... [2018-12-02 05:37:16,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b40b7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:16, skipping insertion in model container [2018-12-02 05:37:16,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:15" (2/3) ... [2018-12-02 05:37:16,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b40b7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:16, skipping insertion in model container [2018-12-02 05:37:16,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:16" (3/3) ... [2018-12-02 05:37:16,396 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_false-unreach-call.i [2018-12-02 05:37:16,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,419 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,420 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,424 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:16,435 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 05:37:16,435 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:37:16,440 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 05:37:16,450 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 05:37:16,465 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:37:16,465 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:37:16,465 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:37:16,465 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:37:16,465 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:37:16,465 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:37:16,466 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:37:16,466 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:37:16,472 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-02 05:37:30,975 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-02 05:37:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-02 05:37:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 05:37:30,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:30,984 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] [2018-12-02 05:37:30,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:30,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-02 05:37:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:37:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:31,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:37:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:31,127 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 05:37:31,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:31,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:37:31,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:37:31,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:37:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:37:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:37:31,141 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-02 05:37:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:32,456 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-02 05:37:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:37:32,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-02 05:37:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:33,218 INFO L225 Difference]: With dead ends: 233472 [2018-12-02 05:37:33,219 INFO L226 Difference]: Without dead ends: 203722 [2018-12-02 05:37:33,220 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 05:37:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-02 05:37:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-02 05:37:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-02 05:37:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-02 05:37:38,383 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-02 05:37:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:38,384 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-02 05:37:38,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:37:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-02 05:37:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:37:38,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:38,391 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 05:37:38,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:38,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-02 05:37:38,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:37:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:38,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:37:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:38,437 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 05:37:38,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:38,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:37:38,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:37:38,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:37:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:37:38,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:37:38,439 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-02 05:37:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:39,397 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-02 05:37:39,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:37:39,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 05:37:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:39,724 INFO L225 Difference]: With dead ends: 118892 [2018-12-02 05:37:39,724 INFO L226 Difference]: Without dead ends: 118892 [2018-12-02 05:37:39,725 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 05:37:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-02 05:37:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-02 05:37:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-02 05:37:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-02 05:37:42,285 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-02 05:37:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:42,285 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-02 05:37:42,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:37:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-02 05:37:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:37:42,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:42,289 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 05:37:42,289 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:42,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-02 05:37:42,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:37:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:42,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:42,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:37:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:42,339 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 05:37:42,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:42,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:37:42,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:37:42,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:37:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:37:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:37:42,340 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-02 05:37:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:46,045 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-02 05:37:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:37:46,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 05:37:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:46,910 INFO L225 Difference]: With dead ends: 325272 [2018-12-02 05:37:46,910 INFO L226 Difference]: Without dead ends: 324272 [2018-12-02 05:37:46,910 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 05:37:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-02 05:37:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-02 05:37:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-02 05:37:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-02 05:37:52,068 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-02 05:37:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:52,068 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-02 05:37:52,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:37:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-02 05:37:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:37:52,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:52,074 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 05:37:52,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:52,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-02 05:37:52,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:37:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:52,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:37:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:52,120 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 05:37:52,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:52,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:37:52,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:37:52,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:37:52,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:37:52,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:37:52,121 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-02 05:37:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:53,799 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-02 05:37:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:37:53,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 05:37:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:55,255 INFO L225 Difference]: With dead ends: 334052 [2018-12-02 05:37:55,255 INFO L226 Difference]: Without dead ends: 333002 [2018-12-02 05:37:55,255 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 05:37:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-02 05:38:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-02 05:38:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-02 05:38:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-02 05:38:03,153 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-02 05:38:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:03,153 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-02 05:38:03,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:38:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-02 05:38:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:38:03,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:03,177 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 05:38:03,177 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:03,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-02 05:38:03,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:38:03,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:03,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:03,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:38:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:03,214 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 05:38:03,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:03,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:38:03,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:38:03,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:38:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:38:03,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:38:03,215 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-02 05:38:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:05,500 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-02 05:38:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:38:05,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 05:38:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:06,389 INFO L225 Difference]: With dead ends: 342292 [2018-12-02 05:38:06,389 INFO L226 Difference]: Without dead ends: 341292 [2018-12-02 05:38:06,389 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 05:38:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-02 05:38:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-02 05:38:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-02 05:38:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-02 05:38:14,148 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-02 05:38:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:14,148 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-02 05:38:14,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:38:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-02 05:38:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 05:38:14,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:14,219 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 05:38:14,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:14,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-02 05:38:14,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:38:14,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:14,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:14,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:38:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:14,305 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 05:38:14,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:14,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:38:14,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:38:14,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:38:14,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:38:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:38:14,306 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-02 05:38:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:15,896 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-02 05:38:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:38:15,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 05:38:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:17,248 INFO L225 Difference]: With dead ends: 312432 [2018-12-02 05:38:17,248 INFO L226 Difference]: Without dead ends: 311792 [2018-12-02 05:38:17,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:38:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-02 05:38:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-02 05:38:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-02 05:38:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-02 05:38:26,409 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-02 05:38:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:26,409 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-02 05:38:26,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:38:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-02 05:38:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 05:38:26,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:26,523 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 05:38:26,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:26,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-02 05:38:26,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:38:26,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:26,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:26,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:26,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:38:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:26,585 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 05:38:26,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:26,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:38:26,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:38:26,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:38:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:38:26,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:38:26,586 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-02 05:38:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:30,595 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-02 05:38:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:38:30,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-02 05:38:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:32,360 INFO L225 Difference]: With dead ends: 617312 [2018-12-02 05:38:32,360 INFO L226 Difference]: Without dead ends: 615712 [2018-12-02 05:38:32,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:38:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-02 05:38:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-02 05:38:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-02 05:38:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-02 05:38:46,107 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-02 05:38:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:46,107 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-02 05:38:46,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:38:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-02 05:38:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:38:46,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:46,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:46,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:46,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-02 05:38:46,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:38:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:46,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:46,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:38:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:46,307 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 05:38:46,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:46,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:38:46,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:38:46,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:38:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:38:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:38:46,308 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-02 05:38:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:49,008 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-02 05:38:49,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:38:49,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 05:38:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:50,229 INFO L225 Difference]: With dead ends: 438907 [2018-12-02 05:38:50,229 INFO L226 Difference]: Without dead ends: 438907 [2018-12-02 05:38:50,229 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 05:38:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-02 05:39:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-02 05:39:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-02 05:39:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-02 05:39:02,198 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-02 05:39:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:39:02,199 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-02 05:39:02,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:39:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-02 05:39:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 05:39:02,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:39:02,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:39:02,951 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:39:02,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:39:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-02 05:39:02,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:39:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:39:02,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:39:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:39:02,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:39:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:39:03,009 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 05:39:03,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:39:03,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:39:03,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:39:03,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:39:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:39:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:39:03,010 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-02 05:39:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:39:07,213 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-02 05:39:07,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:39:07,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-02 05:39:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:39:09,665 INFO L225 Difference]: With dead ends: 675132 [2018-12-02 05:39:09,665 INFO L226 Difference]: Without dead ends: 673532 [2018-12-02 05:39:09,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:39:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-02 05:39:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-02 05:39:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-02 05:39:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-02 05:39:25,019 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-02 05:39:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:39:25,019 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-02 05:39:25,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:39:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-02 05:39:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:39:25,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:39:25,315 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] [2018-12-02 05:39:25,315 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:39:25,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:39:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-02 05:39:25,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:39:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:39:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:39:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:39:25,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:39:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:39:25,381 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 05:39:25,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:39:25,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:39:25,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:39:25,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:39:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:39:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:39:25,382 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 7 states. [2018-12-02 05:39:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:39:28,983 INFO L93 Difference]: Finished difference Result 515737 states and 2256101 transitions. [2018-12-02 05:39:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:39:28,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-02 05:39:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:39:31,100 INFO L225 Difference]: With dead ends: 515737 [2018-12-02 05:39:31,101 INFO L226 Difference]: Without dead ends: 514387 [2018-12-02 05:39:31,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:39:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514387 states. [2018-12-02 05:39:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514387 to 389347. [2018-12-02 05:39:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389347 states. [2018-12-02 05:39:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389347 states to 389347 states and 1713924 transitions. [2018-12-02 05:39:44,635 INFO L78 Accepts]: Start accepts. Automaton has 389347 states and 1713924 transitions. Word has length 72 [2018-12-02 05:39:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:39:44,635 INFO L480 AbstractCegarLoop]: Abstraction has 389347 states and 1713924 transitions. [2018-12-02 05:39:44,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:39:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 389347 states and 1713924 transitions. [2018-12-02 05:39:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:39:44,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:39:44,974 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] [2018-12-02 05:39:44,974 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:39:44,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:39:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 146003645, now seen corresponding path program 1 times [2018-12-02 05:39:44,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:39:44,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:39:44,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:39:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:39:44,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:39:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:39:45,037 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 05:39:45,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:39:45,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:39:45,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:39:45,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:39:45,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:39:45,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:39:45,037 INFO L87 Difference]: Start difference. First operand 389347 states and 1713924 transitions. Second operand 6 states. [2018-12-02 05:39:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:39:48,776 INFO L93 Difference]: Finished difference Result 508422 states and 2226794 transitions. [2018-12-02 05:39:48,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:39:48,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-02 05:39:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:39:50,222 INFO L225 Difference]: With dead ends: 508422 [2018-12-02 05:39:50,222 INFO L226 Difference]: Without dead ends: 502462 [2018-12-02 05:39:50,222 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 05:39:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502462 states. [2018-12-02 05:39:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502462 to 439622. [2018-12-02 05:39:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439622 states. [2018-12-02 05:40:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439622 states to 439622 states and 1937949 transitions. [2018-12-02 05:40:00,045 INFO L78 Accepts]: Start accepts. Automaton has 439622 states and 1937949 transitions. Word has length 74 [2018-12-02 05:40:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:00,045 INFO L480 AbstractCegarLoop]: Abstraction has 439622 states and 1937949 transitions. [2018-12-02 05:40:00,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 439622 states and 1937949 transitions. [2018-12-02 05:40:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:40:00,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:00,464 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] [2018-12-02 05:40:00,464 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:00,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash -137146819, now seen corresponding path program 1 times [2018-12-02 05:40:00,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:00,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:00,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:00,524 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 05:40:00,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:00,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:40:00,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:00,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:40:00,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:40:00,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:00,525 INFO L87 Difference]: Start difference. First operand 439622 states and 1937949 transitions. Second operand 7 states. [2018-12-02 05:40:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:07,359 INFO L93 Difference]: Finished difference Result 590157 states and 2550697 transitions. [2018-12-02 05:40:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:40:07,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 05:40:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:09,123 INFO L225 Difference]: With dead ends: 590157 [2018-12-02 05:40:09,123 INFO L226 Difference]: Without dead ends: 590157 [2018-12-02 05:40:09,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:40:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590157 states. [2018-12-02 05:40:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590157 to 542807. [2018-12-02 05:40:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542807 states. [2018-12-02 05:40:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542807 states to 542807 states and 2362207 transitions. [2018-12-02 05:40:21,262 INFO L78 Accepts]: Start accepts. Automaton has 542807 states and 2362207 transitions. Word has length 74 [2018-12-02 05:40:21,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:21,262 INFO L480 AbstractCegarLoop]: Abstraction has 542807 states and 2362207 transitions. [2018-12-02 05:40:21,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:40:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 542807 states and 2362207 transitions. [2018-12-02 05:40:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:40:21,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:21,798 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] [2018-12-02 05:40:21,798 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:21,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1107617662, now seen corresponding path program 1 times [2018-12-02 05:40:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:21,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:21,827 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 05:40:21,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:21,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:40:21,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:21,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:40:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:40:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:40:21,828 INFO L87 Difference]: Start difference. First operand 542807 states and 2362207 transitions. Second operand 4 states. [2018-12-02 05:40:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:29,532 INFO L93 Difference]: Finished difference Result 469758 states and 2015930 transitions. [2018-12-02 05:40:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:40:29,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 05:40:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:30,863 INFO L225 Difference]: With dead ends: 469758 [2018-12-02 05:40:30,864 INFO L226 Difference]: Without dead ends: 467053 [2018-12-02 05:40:30,864 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 05:40:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467053 states. [2018-12-02 05:40:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467053 to 467053. [2018-12-02 05:40:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467053 states. [2018-12-02 05:40:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467053 states to 467053 states and 2006968 transitions. [2018-12-02 05:40:39,676 INFO L78 Accepts]: Start accepts. Automaton has 467053 states and 2006968 transitions. Word has length 74 [2018-12-02 05:40:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:39,676 INFO L480 AbstractCegarLoop]: Abstraction has 467053 states and 2006968 transitions. [2018-12-02 05:40:39,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:40:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 467053 states and 2006968 transitions. [2018-12-02 05:40:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 05:40:40,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:40,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:40,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1793024226, now seen corresponding path program 1 times [2018-12-02 05:40:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:40,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:40,692 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 05:40:40,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:40,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:40:40,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:40,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:40:40,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:40:40,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:40:40,693 INFO L87 Difference]: Start difference. First operand 467053 states and 2006968 transitions. Second operand 5 states. [2018-12-02 05:40:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:41,300 INFO L93 Difference]: Finished difference Result 137697 states and 546963 transitions. [2018-12-02 05:40:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:40:41,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-02 05:40:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:41,606 INFO L225 Difference]: With dead ends: 137697 [2018-12-02 05:40:41,606 INFO L226 Difference]: Without dead ends: 135305 [2018-12-02 05:40:41,607 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 05:40:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135305 states. [2018-12-02 05:40:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135305 to 135245. [2018-12-02 05:40:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135245 states. [2018-12-02 05:40:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135245 states to 135245 states and 537799 transitions. [2018-12-02 05:40:43,875 INFO L78 Accepts]: Start accepts. Automaton has 135245 states and 537799 transitions. Word has length 75 [2018-12-02 05:40:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:43,876 INFO L480 AbstractCegarLoop]: Abstraction has 135245 states and 537799 transitions. [2018-12-02 05:40:43,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:40:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 135245 states and 537799 transitions. [2018-12-02 05:40:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 05:40:44,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:44,003 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] [2018-12-02 05:40:44,003 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:44,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -405984454, now seen corresponding path program 1 times [2018-12-02 05:40:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:44,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:44,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:44,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:44,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:44,045 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 05:40:44,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:44,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:40:44,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:44,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:40:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:40:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:40:44,046 INFO L87 Difference]: Start difference. First operand 135245 states and 537799 transitions. Second operand 4 states. [2018-12-02 05:40:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:45,046 INFO L93 Difference]: Finished difference Result 169525 states and 668412 transitions. [2018-12-02 05:40:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:40:45,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-02 05:40:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:45,413 INFO L225 Difference]: With dead ends: 169525 [2018-12-02 05:40:45,414 INFO L226 Difference]: Without dead ends: 169525 [2018-12-02 05:40:45,414 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 05:40:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169525 states. [2018-12-02 05:40:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169525 to 140469. [2018-12-02 05:40:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140469 states. [2018-12-02 05:40:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140469 states to 140469 states and 557228 transitions. [2018-12-02 05:40:47,838 INFO L78 Accepts]: Start accepts. Automaton has 140469 states and 557228 transitions. Word has length 85 [2018-12-02 05:40:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:47,838 INFO L480 AbstractCegarLoop]: Abstraction has 140469 states and 557228 transitions. [2018-12-02 05:40:47,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:40:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 140469 states and 557228 transitions. [2018-12-02 05:40:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 05:40:47,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:47,974 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] [2018-12-02 05:40:47,974 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:47,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash -660720999, now seen corresponding path program 1 times [2018-12-02 05:40:47,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:47,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:47,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:47,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:47,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:40:48,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:48,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:48,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:48,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:48,024 INFO L87 Difference]: Start difference. First operand 140469 states and 557228 transitions. Second operand 6 states. [2018-12-02 05:40:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:48,107 INFO L93 Difference]: Finished difference Result 20597 states and 70892 transitions. [2018-12-02 05:40:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:40:48,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-02 05:40:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:48,132 INFO L225 Difference]: With dead ends: 20597 [2018-12-02 05:40:48,132 INFO L226 Difference]: Without dead ends: 18885 [2018-12-02 05:40:48,132 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 05:40:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18885 states. [2018-12-02 05:40:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18885 to 18370. [2018-12-02 05:40:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18370 states. [2018-12-02 05:40:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18370 states to 18370 states and 63196 transitions. [2018-12-02 05:40:48,328 INFO L78 Accepts]: Start accepts. Automaton has 18370 states and 63196 transitions. Word has length 85 [2018-12-02 05:40:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:48,328 INFO L480 AbstractCegarLoop]: Abstraction has 18370 states and 63196 transitions. [2018-12-02 05:40:48,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18370 states and 63196 transitions. [2018-12-02 05:40:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 05:40:48,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:48,344 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] [2018-12-02 05:40:48,344 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:48,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-02 05:40:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:48,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:48,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:48,363 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 05:40:48,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:48,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:40:48,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:48,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:40:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:40:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:40:48,364 INFO L87 Difference]: Start difference. First operand 18370 states and 63196 transitions. Second operand 3 states. [2018-12-02 05:40:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:48,466 INFO L93 Difference]: Finished difference Result 18790 states and 64462 transitions. [2018-12-02 05:40:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:40:48,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-02 05:40:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:48,489 INFO L225 Difference]: With dead ends: 18790 [2018-12-02 05:40:48,490 INFO L226 Difference]: Without dead ends: 18790 [2018-12-02 05:40:48,490 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 05:40:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2018-12-02 05:40:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 18560. [2018-12-02 05:40:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18560 states. [2018-12-02 05:40:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 63768 transitions. [2018-12-02 05:40:48,781 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 63768 transitions. Word has length 98 [2018-12-02 05:40:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:48,781 INFO L480 AbstractCegarLoop]: Abstraction has 18560 states and 63768 transitions. [2018-12-02 05:40:48,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:40:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 63768 transitions. [2018-12-02 05:40:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 05:40:48,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:48,796 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] [2018-12-02 05:40:48,796 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:48,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2037064255, now seen corresponding path program 1 times [2018-12-02 05:40:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:48,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:48,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:48,841 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 05:40:48,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:48,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:40:48,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:48,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:40:48,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:40:48,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:40:48,842 INFO L87 Difference]: Start difference. First operand 18560 states and 63768 transitions. Second operand 5 states. [2018-12-02 05:40:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:48,996 INFO L93 Difference]: Finished difference Result 20705 states and 70469 transitions. [2018-12-02 05:40:48,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:40:48,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-02 05:40:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:49,020 INFO L225 Difference]: With dead ends: 20705 [2018-12-02 05:40:49,021 INFO L226 Difference]: Without dead ends: 20705 [2018-12-02 05:40:49,021 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 05:40:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20705 states. [2018-12-02 05:40:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20705 to 20501. [2018-12-02 05:40:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2018-12-02 05:40:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 69869 transitions. [2018-12-02 05:40:49,233 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 69869 transitions. Word has length 98 [2018-12-02 05:40:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:49,233 INFO L480 AbstractCegarLoop]: Abstraction has 20501 states and 69869 transitions. [2018-12-02 05:40:49,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:40:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 69869 transitions. [2018-12-02 05:40:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 05:40:49,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:49,249 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] [2018-12-02 05:40:49,250 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:49,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2029304896, now seen corresponding path program 2 times [2018-12-02 05:40:49,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:49,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:49,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:49,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:49,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:49,282 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 05:40:49,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:49,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:40:49,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:49,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:40:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:40:49,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:40:49,283 INFO L87 Difference]: Start difference. First operand 20501 states and 69869 transitions. Second operand 4 states. [2018-12-02 05:40:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:49,475 INFO L93 Difference]: Finished difference Result 27185 states and 92953 transitions. [2018-12-02 05:40:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:40:49,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 05:40:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:49,509 INFO L225 Difference]: With dead ends: 27185 [2018-12-02 05:40:49,509 INFO L226 Difference]: Without dead ends: 27185 [2018-12-02 05:40:49,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:40:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27185 states. [2018-12-02 05:40:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27185 to 20711. [2018-12-02 05:40:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20711 states. [2018-12-02 05:40:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20711 states to 20711 states and 70497 transitions. [2018-12-02 05:40:49,759 INFO L78 Accepts]: Start accepts. Automaton has 20711 states and 70497 transitions. Word has length 98 [2018-12-02 05:40:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:49,760 INFO L480 AbstractCegarLoop]: Abstraction has 20711 states and 70497 transitions. [2018-12-02 05:40:49,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:40:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 20711 states and 70497 transitions. [2018-12-02 05:40:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:49,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:49,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, 1] [2018-12-02 05:40:49,776 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:49,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-02 05:40:49,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:49,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:49,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:49,803 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 05:40:49,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:49,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:40:49,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:49,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:40:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:40:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:40:49,804 INFO L87 Difference]: Start difference. First operand 20711 states and 70497 transitions. Second operand 4 states. [2018-12-02 05:40:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:49,960 INFO L93 Difference]: Finished difference Result 36869 states and 125561 transitions. [2018-12-02 05:40:49,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:40:49,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 05:40:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:50,009 INFO L225 Difference]: With dead ends: 36869 [2018-12-02 05:40:50,009 INFO L226 Difference]: Without dead ends: 36869 [2018-12-02 05:40:50,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:40:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36869 states. [2018-12-02 05:40:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36869 to 20461. [2018-12-02 05:40:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20461 states. [2018-12-02 05:40:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20461 states to 20461 states and 69372 transitions. [2018-12-02 05:40:50,305 INFO L78 Accepts]: Start accepts. Automaton has 20461 states and 69372 transitions. Word has length 100 [2018-12-02 05:40:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:50,305 INFO L480 AbstractCegarLoop]: Abstraction has 20461 states and 69372 transitions. [2018-12-02 05:40:50,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:40:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20461 states and 69372 transitions. [2018-12-02 05:40:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:50,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:50,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:50,323 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:50,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2017356457, now seen corresponding path program 1 times [2018-12-02 05:40:50,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:50,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:50,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:50,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:50,369 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 05:40:50,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:50,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:50,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:50,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:50,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:50,370 INFO L87 Difference]: Start difference. First operand 20461 states and 69372 transitions. Second operand 6 states. [2018-12-02 05:40:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:50,613 INFO L93 Difference]: Finished difference Result 22461 states and 75447 transitions. [2018-12-02 05:40:50,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:40:50,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 05:40:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:50,639 INFO L225 Difference]: With dead ends: 22461 [2018-12-02 05:40:50,639 INFO L226 Difference]: Without dead ends: 22461 [2018-12-02 05:40:50,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22461 states. [2018-12-02 05:40:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22461 to 20806. [2018-12-02 05:40:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20806 states. [2018-12-02 05:40:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 70433 transitions. [2018-12-02 05:40:50,846 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 70433 transitions. Word has length 100 [2018-12-02 05:40:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:50,846 INFO L480 AbstractCegarLoop]: Abstraction has 20806 states and 70433 transitions. [2018-12-02 05:40:50,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 70433 transitions. [2018-12-02 05:40:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:50,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:50,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:50,862 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:50,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1047775434, now seen corresponding path program 1 times [2018-12-02 05:40:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:50,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:50,913 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 05:40:50,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:50,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:50,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:50,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:50,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:50,914 INFO L87 Difference]: Start difference. First operand 20806 states and 70433 transitions. Second operand 6 states. [2018-12-02 05:40:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:51,070 INFO L93 Difference]: Finished difference Result 20070 states and 67756 transitions. [2018-12-02 05:40:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:40:51,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 05:40:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:51,095 INFO L225 Difference]: With dead ends: 20070 [2018-12-02 05:40:51,095 INFO L226 Difference]: Without dead ends: 20070 [2018-12-02 05:40:51,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:40:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2018-12-02 05:40:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 19676. [2018-12-02 05:40:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19676 states. [2018-12-02 05:40:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19676 states to 19676 states and 66594 transitions. [2018-12-02 05:40:51,291 INFO L78 Accepts]: Start accepts. Automaton has 19676 states and 66594 transitions. Word has length 100 [2018-12-02 05:40:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:51,291 INFO L480 AbstractCegarLoop]: Abstraction has 19676 states and 66594 transitions. [2018-12-02 05:40:51,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19676 states and 66594 transitions. [2018-12-02 05:40:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:51,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:51,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:51,306 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:51,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1452574727, now seen corresponding path program 1 times [2018-12-02 05:40:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:51,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:51,353 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 05:40:51,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:51,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:51,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:51,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:51,354 INFO L87 Difference]: Start difference. First operand 19676 states and 66594 transitions. Second operand 6 states. [2018-12-02 05:40:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:51,620 INFO L93 Difference]: Finished difference Result 21251 states and 70879 transitions. [2018-12-02 05:40:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:40:51,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 05:40:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:51,644 INFO L225 Difference]: With dead ends: 21251 [2018-12-02 05:40:51,644 INFO L226 Difference]: Without dead ends: 20701 [2018-12-02 05:40:51,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20701 states. [2018-12-02 05:40:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20701 to 20126. [2018-12-02 05:40:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20126 states. [2018-12-02 05:40:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 67784 transitions. [2018-12-02 05:40:51,838 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 67784 transitions. Word has length 100 [2018-12-02 05:40:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:51,838 INFO L480 AbstractCegarLoop]: Abstraction has 20126 states and 67784 transitions. [2018-12-02 05:40:51,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 67784 transitions. [2018-12-02 05:40:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:51,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:51,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:51,853 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:51,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash 248165752, now seen corresponding path program 1 times [2018-12-02 05:40:51,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:51,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:51,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:51,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:51,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:51,906 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 05:40:51,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:51,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:40:51,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:51,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:40:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:40:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:51,907 INFO L87 Difference]: Start difference. First operand 20126 states and 67784 transitions. Second operand 7 states. [2018-12-02 05:40:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:52,086 INFO L93 Difference]: Finished difference Result 21079 states and 70852 transitions. [2018-12-02 05:40:52,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:40:52,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-02 05:40:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:52,113 INFO L225 Difference]: With dead ends: 21079 [2018-12-02 05:40:52,114 INFO L226 Difference]: Without dead ends: 21079 [2018-12-02 05:40:52,114 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 05:40:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21079 states. [2018-12-02 05:40:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21079 to 20031. [2018-12-02 05:40:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20031 states. [2018-12-02 05:40:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20031 states to 20031 states and 67508 transitions. [2018-12-02 05:40:52,337 INFO L78 Accepts]: Start accepts. Automaton has 20031 states and 67508 transitions. Word has length 100 [2018-12-02 05:40:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:52,337 INFO L480 AbstractCegarLoop]: Abstraction has 20031 states and 67508 transitions. [2018-12-02 05:40:52,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:40:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20031 states and 67508 transitions. [2018-12-02 05:40:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:52,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:52,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:52,353 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:52,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1659045272, now seen corresponding path program 1 times [2018-12-02 05:40:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:52,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:52,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:52,465 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 05:40:52,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:40:52,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:52,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:40:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:40:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:40:52,466 INFO L87 Difference]: Start difference. First operand 20031 states and 67508 transitions. Second operand 5 states. [2018-12-02 05:40:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:52,570 INFO L93 Difference]: Finished difference Result 18687 states and 63075 transitions. [2018-12-02 05:40:52,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:40:52,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-02 05:40:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:52,592 INFO L225 Difference]: With dead ends: 18687 [2018-12-02 05:40:52,592 INFO L226 Difference]: Without dead ends: 18687 [2018-12-02 05:40:52,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2018-12-02 05:40:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18502. [2018-12-02 05:40:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2018-12-02 05:40:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 62557 transitions. [2018-12-02 05:40:52,776 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 62557 transitions. Word has length 100 [2018-12-02 05:40:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:52,776 INFO L480 AbstractCegarLoop]: Abstraction has 18502 states and 62557 transitions. [2018-12-02 05:40:52,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:40:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 62557 transitions. [2018-12-02 05:40:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:40:52,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:52,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:52,791 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:52,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash -127158119, now seen corresponding path program 1 times [2018-12-02 05:40:52,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:52,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:52,865 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 05:40:52,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:52,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:52,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:52,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:52,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:52,866 INFO L87 Difference]: Start difference. First operand 18502 states and 62557 transitions. Second operand 6 states. [2018-12-02 05:40:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:52,981 INFO L93 Difference]: Finished difference Result 12422 states and 40685 transitions. [2018-12-02 05:40:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:40:52,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 05:40:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:52,995 INFO L225 Difference]: With dead ends: 12422 [2018-12-02 05:40:52,995 INFO L226 Difference]: Without dead ends: 12422 [2018-12-02 05:40:52,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2018-12-02 05:40:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 10933. [2018-12-02 05:40:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2018-12-02 05:40:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 36071 transitions. [2018-12-02 05:40:53,108 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 36071 transitions. Word has length 100 [2018-12-02 05:40:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:53,109 INFO L480 AbstractCegarLoop]: Abstraction has 10933 states and 36071 transitions. [2018-12-02 05:40:53,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 36071 transitions. [2018-12-02 05:40:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:53,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:53,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:53,118 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:53,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-02 05:40:53,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:53,166 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 05:40:53,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:53,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:40:53,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:53,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:40:53,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:40:53,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:53,167 INFO L87 Difference]: Start difference. First operand 10933 states and 36071 transitions. Second operand 7 states. [2018-12-02 05:40:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:53,518 INFO L93 Difference]: Finished difference Result 17605 states and 56946 transitions. [2018-12-02 05:40:53,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:40:53,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 05:40:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:53,540 INFO L225 Difference]: With dead ends: 17605 [2018-12-02 05:40:53,540 INFO L226 Difference]: Without dead ends: 17477 [2018-12-02 05:40:53,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:40:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2018-12-02 05:40:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 13761. [2018-12-02 05:40:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-02 05:40:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45019 transitions. [2018-12-02 05:40:53,696 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45019 transitions. Word has length 102 [2018-12-02 05:40:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:53,696 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45019 transitions. [2018-12-02 05:40:53,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:40:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45019 transitions. [2018-12-02 05:40:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:53,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:53,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:53,708 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:53,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-02 05:40:53,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:53,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:53,764 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 05:40:53,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:53,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:53,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:53,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:53,765 INFO L87 Difference]: Start difference. First operand 13761 states and 45019 transitions. Second operand 6 states. [2018-12-02 05:40:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:53,872 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-02 05:40:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:40:53,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-02 05:40:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:53,888 INFO L225 Difference]: With dead ends: 14001 [2018-12-02 05:40:53,888 INFO L226 Difference]: Without dead ends: 14001 [2018-12-02 05:40:53,888 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 05:40:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-02 05:40:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-02 05:40:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-02 05:40:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-02 05:40:54,021 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-02 05:40:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:54,021 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-02 05:40:54,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-02 05:40:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:54,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:54,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:54,032 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:54,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-02 05:40:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:54,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:54,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:54,076 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 05:40:54,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:54,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:40:54,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:54,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:40:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:40:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:40:54,077 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-02 05:40:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:54,215 INFO L93 Difference]: Finished difference Result 22583 states and 74515 transitions. [2018-12-02 05:40:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:40:54,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-02 05:40:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:54,243 INFO L225 Difference]: With dead ends: 22583 [2018-12-02 05:40:54,243 INFO L226 Difference]: Without dead ends: 22583 [2018-12-02 05:40:54,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:40:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22583 states. [2018-12-02 05:40:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22583 to 13931. [2018-12-02 05:40:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13931 states. [2018-12-02 05:40:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13931 states to 13931 states and 45215 transitions. [2018-12-02 05:40:54,427 INFO L78 Accepts]: Start accepts. Automaton has 13931 states and 45215 transitions. Word has length 102 [2018-12-02 05:40:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:54,427 INFO L480 AbstractCegarLoop]: Abstraction has 13931 states and 45215 transitions. [2018-12-02 05:40:54,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:40:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 13931 states and 45215 transitions. [2018-12-02 05:40:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:54,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:54,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:54,440 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:54,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2093366609, now seen corresponding path program 1 times [2018-12-02 05:40:54,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:54,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:54,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:54,483 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 05:40:54,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:54,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:40:54,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:54,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:40:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:40:54,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:40:54,484 INFO L87 Difference]: Start difference. First operand 13931 states and 45215 transitions. Second operand 5 states. [2018-12-02 05:40:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:54,636 INFO L93 Difference]: Finished difference Result 15723 states and 50975 transitions. [2018-12-02 05:40:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:40:54,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-02 05:40:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:54,653 INFO L225 Difference]: With dead ends: 15723 [2018-12-02 05:40:54,653 INFO L226 Difference]: Without dead ends: 15595 [2018-12-02 05:40:54,653 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 05:40:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15595 states. [2018-12-02 05:40:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15595 to 11630. [2018-12-02 05:40:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2018-12-02 05:40:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 37935 transitions. [2018-12-02 05:40:54,783 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 37935 transitions. Word has length 102 [2018-12-02 05:40:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:54,783 INFO L480 AbstractCegarLoop]: Abstraction has 11630 states and 37935 transitions. [2018-12-02 05:40:54,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:40:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 37935 transitions. [2018-12-02 05:40:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:54,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:54,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:54,793 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:54,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash -848602128, now seen corresponding path program 1 times [2018-12-02 05:40:54,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:54,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:54,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:54,877 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 05:40:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:40:54,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:54,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:40:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:40:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:40:54,878 INFO L87 Difference]: Start difference. First operand 11630 states and 37935 transitions. Second operand 10 states. [2018-12-02 05:40:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:55,212 INFO L93 Difference]: Finished difference Result 22106 states and 72536 transitions. [2018-12-02 05:40:55,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:40:55,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-02 05:40:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:55,224 INFO L225 Difference]: With dead ends: 22106 [2018-12-02 05:40:55,224 INFO L226 Difference]: Without dead ends: 10938 [2018-12-02 05:40:55,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:40:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10938 states. [2018-12-02 05:40:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10938 to 10938. [2018-12-02 05:40:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10938 states. [2018-12-02 05:40:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10938 states to 10938 states and 35895 transitions. [2018-12-02 05:40:55,329 INFO L78 Accepts]: Start accepts. Automaton has 10938 states and 35895 transitions. Word has length 102 [2018-12-02 05:40:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:55,329 INFO L480 AbstractCegarLoop]: Abstraction has 10938 states and 35895 transitions. [2018-12-02 05:40:55,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:40:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10938 states and 35895 transitions. [2018-12-02 05:40:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:55,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:55,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:55,338 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:55,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1501379030, now seen corresponding path program 2 times [2018-12-02 05:40:55,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:55,399 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 05:40:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:40:55,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:55,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:40:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:40:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:55,400 INFO L87 Difference]: Start difference. First operand 10938 states and 35895 transitions. Second operand 7 states. [2018-12-02 05:40:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:55,592 INFO L93 Difference]: Finished difference Result 18188 states and 60554 transitions. [2018-12-02 05:40:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:40:55,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 05:40:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:55,601 INFO L225 Difference]: With dead ends: 18188 [2018-12-02 05:40:55,601 INFO L226 Difference]: Without dead ends: 7461 [2018-12-02 05:40:55,601 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 05:40:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-02 05:40:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-02 05:40:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-02 05:40:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25211 transitions. [2018-12-02 05:40:55,671 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25211 transitions. Word has length 102 [2018-12-02 05:40:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:55,672 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25211 transitions. [2018-12-02 05:40:55,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:40:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25211 transitions. [2018-12-02 05:40:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:55,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:55,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:55,678 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-02 05:40:55,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:55,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:55,732 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 05:40:55,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:55,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:40:55,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:55,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:40:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:40:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:40:55,733 INFO L87 Difference]: Start difference. First operand 7461 states and 25211 transitions. Second operand 7 states. [2018-12-02 05:40:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:55,942 INFO L93 Difference]: Finished difference Result 9597 states and 31665 transitions. [2018-12-02 05:40:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:40:55,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 05:40:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:55,953 INFO L225 Difference]: With dead ends: 9597 [2018-12-02 05:40:55,953 INFO L226 Difference]: Without dead ends: 9461 [2018-12-02 05:40:55,953 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 05:40:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2018-12-02 05:40:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 7445. [2018-12-02 05:40:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2018-12-02 05:40:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 25119 transitions. [2018-12-02 05:40:56,033 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 25119 transitions. Word has length 102 [2018-12-02 05:40:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:56,034 INFO L480 AbstractCegarLoop]: Abstraction has 7445 states and 25119 transitions. [2018-12-02 05:40:56,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:40:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 25119 transitions. [2018-12-02 05:40:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:56,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:56,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:56,040 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:56,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-02 05:40:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:56,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:56,092 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 05:40:56,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:40:56,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:56,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:40:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:40:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:40:56,092 INFO L87 Difference]: Start difference. First operand 7445 states and 25119 transitions. Second operand 5 states. [2018-12-02 05:40:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:56,133 INFO L93 Difference]: Finished difference Result 7445 states and 25051 transitions. [2018-12-02 05:40:56,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:40:56,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-02 05:40:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:56,146 INFO L225 Difference]: With dead ends: 7445 [2018-12-02 05:40:56,146 INFO L226 Difference]: Without dead ends: 7445 [2018-12-02 05:40:56,147 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 05:40:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7445 states. [2018-12-02 05:40:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7445 to 7429. [2018-12-02 05:40:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2018-12-02 05:40:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 25007 transitions. [2018-12-02 05:40:56,220 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 25007 transitions. Word has length 102 [2018-12-02 05:40:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:56,221 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 25007 transitions. [2018-12-02 05:40:56,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:40:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 25007 transitions. [2018-12-02 05:40:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:56,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:56,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:56,226 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:56,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-02 05:40:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:40:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:56,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:40:56,306 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 05:40:56,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:40:56,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:40:56,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:40:56,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:40:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:40:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:40:56,307 INFO L87 Difference]: Start difference. First operand 7429 states and 25007 transitions. Second operand 12 states. [2018-12-02 05:40:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:40:56,621 INFO L93 Difference]: Finished difference Result 14457 states and 48810 transitions. [2018-12-02 05:40:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:40:56,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-02 05:40:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:40:56,632 INFO L225 Difference]: With dead ends: 14457 [2018-12-02 05:40:56,632 INFO L226 Difference]: Without dead ends: 9913 [2018-12-02 05:40:56,633 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 05:40:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2018-12-02 05:40:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9305. [2018-12-02 05:40:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9305 states. [2018-12-02 05:40:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 30650 transitions. [2018-12-02 05:40:56,725 INFO L78 Accepts]: Start accepts. Automaton has 9305 states and 30650 transitions. Word has length 102 [2018-12-02 05:40:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:40:56,726 INFO L480 AbstractCegarLoop]: Abstraction has 9305 states and 30650 transitions. [2018-12-02 05:40:56,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:40:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9305 states and 30650 transitions. [2018-12-02 05:40:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:40:56,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:40:56,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:40:56,734 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:40:56,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:40:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1730295936, now seen corresponding path program 4 times [2018-12-02 05:40:56,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:40:56,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:56,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:40:56,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:40:56,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:40:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:40:56,771 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:40:56,843 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 05:40:56,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:40:56 BasicIcfg [2018-12-02 05:40:56,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:40:56,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:40:56,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:40:56,845 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:40:56,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:16" (3/4) ... [2018-12-02 05:40:56,847 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:40:56,920 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_daea1534-c5bf-4b9d-b2ab-b73106824cc3/bin-2019/utaipan/witness.graphml [2018-12-02 05:40:56,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:40:56,921 INFO L168 Benchmark]: Toolchain (without parser) took 221291.03 ms. Allocated memory was 1.0 GB in the beginning and 11.4 GB in the end (delta: 10.4 GB). Free memory was 952.4 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. [2018-12-02 05:40:56,922 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:40:56,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:40:56,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:40:56,922 INFO L168 Benchmark]: Boogie Preprocessor took 20.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:40:56,923 INFO L168 Benchmark]: RCFGBuilder took 338.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:40:56,923 INFO L168 Benchmark]: TraceAbstraction took 220452.15 ms. Allocated memory was 1.2 GB in the beginning and 11.4 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.2 GB. Max. memory is 11.5 GB. [2018-12-02 05:40:56,923 INFO L168 Benchmark]: Witness Printer took 75.24 ms. Allocated memory is still 11.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:40:56,925 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 338.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 220452.15 ms. Allocated memory was 1.2 GB in the beginning and 11.4 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.2 GB. Max. memory is 11.5 GB. * Witness Printer took 75.24 ms. Allocated memory is still 11.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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 t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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(&t1494, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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 t1495; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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(&t1495, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L780] -1 pthread_t t1496; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L781] FCALL, FORK -1 pthread_create(&t1496, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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] [L754] 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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=1] [L725] 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=1, __unbuffered_p2_EAX=0, 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=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 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=1, __unbuffered_p2_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 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) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] 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=1, __unbuffered_p2_EAX=0, 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_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=1] [L727] 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 [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 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) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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_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=1] [L729] 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 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] 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=2, __unbuffered_p2_EAX=0, 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=1] [L756] 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 [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] 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=2, __unbuffered_p2_EAX=0, 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=1] [L758] 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 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L787] 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, __unbuffered_p2_EAX=0, 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=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L787] 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, __unbuffered_p2_EAX=0, 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=1] [L787] -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) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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, __unbuffered_p2_EAX=0, 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=1] [L789] -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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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, __unbuffered_p2_EAX=0, 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=1] [L791] -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 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L798] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L798] -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) [L799] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L799] -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)) [L800] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L800] -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)) [L801] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L801] -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)) [L802] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L802] -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)) [L803] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L803] -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)) [L804] 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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L804] -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)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 220.3s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 68.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9003 SDtfs, 10115 SDslu, 21828 SDs, 0 SdLazy, 7839 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 106 SyntacticMatches, 19 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542807occurred in iteration=12, 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: 131.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 1452096 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3073 NumberOfCodeBlocks, 3073 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2936 ConstructedInterpolants, 0 QuantifiedInterpolants, 597669 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...