./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_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_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/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 247821aa8b253fe8fc81d40b100d4dcc19685396 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:22:06,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:22:06,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:22:06,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:22:06,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:22:06,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:22:06,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:22:06,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:22:06,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:22:06,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:22:06,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:22:06,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:22:06,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:22:06,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:22:06,851 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:22:06,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:22:06,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:22:06,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:22:06,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:22:06,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:22:06,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:22:06,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:22:06,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:22:06,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:22:06,857 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:22:06,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:22:06,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:22:06,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:22:06,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:22:06,859 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:22:06,859 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:22:06,860 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:22:06,860 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:22:06,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:22:06,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:22:06,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:22:06,861 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 15:22:06,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:22:06,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:22:06,869 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:22:06,869 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:22:06,869 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:22:06,869 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:22:06,869 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:22:06,870 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 15:22:06,870 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:22:06,870 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:22:06,870 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 15:22:06,870 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 15:22:06,870 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:22:06,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:22:06,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:22:06,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:22:06,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:22:06,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:22:06,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:22:06,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:22:06,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:22:06,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:22:06,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:22:06,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:22:06,873 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 15:22:06,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:22:06,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:22:06,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 15:22:06,873 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_bbd7293e-4364-4beb-bfa7-aaf459d736bc/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 -> 247821aa8b253fe8fc81d40b100d4dcc19685396 [2018-12-02 15:22:06,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:22:06,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:22:06,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:22:06,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:22:06,905 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:22:06,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_false-unreach-call.i [2018-12-02 15:22:06,945 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/data/67e6af995/3a544eb7b10444f187c8ccdec664e9a3/FLAGf8dbbf728 [2018-12-02 15:22:07,312 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:22:07,312 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_false-unreach-call.i [2018-12-02 15:22:07,319 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/data/67e6af995/3a544eb7b10444f187c8ccdec664e9a3/FLAGf8dbbf728 [2018-12-02 15:22:07,327 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/data/67e6af995/3a544eb7b10444f187c8ccdec664e9a3 [2018-12-02 15:22:07,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:22:07,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:22:07,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:22:07,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:22:07,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:22:07,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07, skipping insertion in model container [2018-12-02 15:22:07,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:22:07,360 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:22:07,534 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:22:07,542 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:22:07,614 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:22:07,644 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:22:07,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07 WrapperNode [2018-12-02 15:22:07,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:22:07,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:22:07,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:22:07,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:22:07,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:22:07,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:22:07,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:22:07,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:22:07,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... [2018-12-02 15:22:07,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:22:07,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:22:07,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:22:07,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:22:07,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/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 15:22:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:22:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:22:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 15:22:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:22:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 15:22:07,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 15:22:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 15:22:07,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 15:22:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 15:22:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:22:07,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:22:07,734 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 15:22:08,042 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:22:08,042 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 15:22:08,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:22:08 BoogieIcfgContainer [2018-12-02 15:22:08,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:22:08,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:22:08,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:22:08,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:22:08,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:22:07" (1/3) ... [2018-12-02 15:22:08,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd0e5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:22:08, skipping insertion in model container [2018-12-02 15:22:08,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:22:07" (2/3) ... [2018-12-02 15:22:08,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd0e5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:22:08, skipping insertion in model container [2018-12-02 15:22:08,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:22:08" (3/3) ... [2018-12-02 15:22:08,047 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_false-unreach-call.i [2018-12-02 15:22:08,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,071 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,071 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,071 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 15:22:08,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 15:22:08,092 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:22:08,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 15:22:08,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 15:22:08,123 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:22:08,123 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 15:22:08,123 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:22:08,123 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:22:08,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:22:08,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:22:08,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:22:08,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:22:08,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 15:22:09,758 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 15:22:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 15:22:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 15:22:09,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:09,765 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] [2018-12-02 15:22:09,767 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:09,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:09,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-02 15:22:09,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:09,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:09,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:09,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:09,921 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 15:22:09,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:09,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:22:09,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:09,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:22:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:22:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:22:09,936 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 15:22:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:10,428 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 15:22:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:22:10,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 15:22:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:10,598 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 15:22:10,599 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 15:22:10,600 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 15:22:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 15:22:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 15:22:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 15:22:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 15:22:11,375 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 15:22:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:11,375 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 15:22:11,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:22:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 15:22:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 15:22:11,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:11,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:11,380 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:11,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-02 15:22:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:11,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:11,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:22:11,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:11,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:11,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:11,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:11,432 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-02 15:22:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:11,971 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-02 15:22:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:22:11,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 15:22:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:12,243 INFO L225 Difference]: With dead ends: 64005 [2018-12-02 15:22:12,244 INFO L226 Difference]: Without dead ends: 63453 [2018-12-02 15:22:12,244 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 15:22:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-02 15:22:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-02 15:22:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-02 15:22:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-02 15:22:12,987 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-02 15:22:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:12,988 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-02 15:22:12,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-02 15:22:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 15:22:12,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:12,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:12,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:12,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-02 15:22:12,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:12,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:12,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:13,039 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 15:22:13,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:13,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:13,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:13,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:13,041 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-02 15:22:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:13,578 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-02 15:22:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:22:13,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 15:22:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:13,724 INFO L225 Difference]: With dead ends: 81367 [2018-12-02 15:22:13,724 INFO L226 Difference]: Without dead ends: 80855 [2018-12-02 15:22:13,725 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 15:22:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-02 15:22:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-02 15:22:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-02 15:22:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-02 15:22:14,753 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-02 15:22:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:14,753 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-02 15:22:14,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-02 15:22:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 15:22:14,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:14,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:14,758 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:14,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:14,759 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-02 15:22:14,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:14,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:14,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:14,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:14,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:14,783 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 15:22:14,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:14,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:22:14,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:14,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:22:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:22:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:22:14,784 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-02 15:22:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:15,005 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-02 15:22:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:22:15,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 15:22:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:15,120 INFO L225 Difference]: With dead ends: 65251 [2018-12-02 15:22:15,120 INFO L226 Difference]: Without dead ends: 65251 [2018-12-02 15:22:15,120 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 15:22:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-02 15:22:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-02 15:22:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-02 15:22:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-02 15:22:16,157 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-02 15:22:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:16,157 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-02 15:22:16,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:22:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-02 15:22:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:22:16,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:16,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:16,165 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:16,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-02 15:22:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:16,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:16,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:16,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:16,246 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 15:22:16,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:16,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:16,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:16,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:16,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:16,247 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-02 15:22:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:16,759 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-02 15:22:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:22:16,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 15:22:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:16,880 INFO L225 Difference]: With dead ends: 67511 [2018-12-02 15:22:16,881 INFO L226 Difference]: Without dead ends: 67511 [2018-12-02 15:22:16,881 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 15:22:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-02 15:22:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-02 15:22:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-02 15:22:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-02 15:22:17,969 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-02 15:22:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:17,970 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-02 15:22:17,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-02 15:22:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:22:17,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:17,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:17,979 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:17,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-02 15:22:17,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:17,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:17,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:17,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:22:18,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:18,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:18,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:18,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:18,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:18,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:18,042 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-02 15:22:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:18,755 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-02 15:22:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:22:18,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 15:22:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:18,902 INFO L225 Difference]: With dead ends: 88528 [2018-12-02 15:22:18,902 INFO L226 Difference]: Without dead ends: 88528 [2018-12-02 15:22:18,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:22:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-02 15:22:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-02 15:22:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-02 15:22:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-02 15:22:20,273 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-02 15:22:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:20,273 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-02 15:22:20,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-02 15:22:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:22:20,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:20,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:20,283 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:20,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-02 15:22:20,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:20,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:20,320 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 15:22:20,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:20,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:22:20,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:20,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:22:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:22:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:22:20,321 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-02 15:22:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:20,502 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-02 15:22:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:22:20,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 15:22:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:20,596 INFO L225 Difference]: With dead ends: 57182 [2018-12-02 15:22:20,597 INFO L226 Difference]: Without dead ends: 57182 [2018-12-02 15:22:20,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:22:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-02 15:22:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-02 15:22:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-02 15:22:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-02 15:22:21,446 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-02 15:22:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:21,446 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-02 15:22:21,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:22:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-02 15:22:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:22:21,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:21,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:21,453 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:21,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:21,453 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-02 15:22:21,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:21,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:21,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:21,500 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 15:22:21,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:21,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:21,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:21,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:21,501 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-02 15:22:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:22,129 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-02 15:22:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:22:22,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 15:22:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:22,286 INFO L225 Difference]: With dead ends: 97908 [2018-12-02 15:22:22,286 INFO L226 Difference]: Without dead ends: 97332 [2018-12-02 15:22:22,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 15:22:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-02 15:22:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-02 15:22:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-02 15:22:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-02 15:22:23,400 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-02 15:22:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:23,400 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-02 15:22:23,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-02 15:22:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:22:23,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:23,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:23,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:23,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-02 15:22:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:23,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:23,477 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 15:22:23,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:23,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:23,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:23,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:23,478 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 5 states. [2018-12-02 15:22:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:23,771 INFO L93 Difference]: Finished difference Result 56810 states and 198218 transitions. [2018-12-02 15:22:23,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:22:23,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 15:22:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:23,871 INFO L225 Difference]: With dead ends: 56810 [2018-12-02 15:22:23,871 INFO L226 Difference]: Without dead ends: 56810 [2018-12-02 15:22:23,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2018-12-02 15:22:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 56721. [2018-12-02 15:22:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56721 states. [2018-12-02 15:22:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56721 states to 56721 states and 197943 transitions. [2018-12-02 15:22:24,745 INFO L78 Accepts]: Start accepts. Automaton has 56721 states and 197943 transitions. Word has length 54 [2018-12-02 15:22:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:24,745 INFO L480 AbstractCegarLoop]: Abstraction has 56721 states and 197943 transitions. [2018-12-02 15:22:24,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 56721 states and 197943 transitions. [2018-12-02 15:22:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:22:24,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:24,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:24,752 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:24,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1332981747, now seen corresponding path program 1 times [2018-12-02 15:22:24,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:24,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:24,772 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 15:22:24,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:24,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:22:24,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:24,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:22:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:22:24,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:22:24,773 INFO L87 Difference]: Start difference. First operand 56721 states and 197943 transitions. Second operand 4 states. [2018-12-02 15:22:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:24,817 INFO L93 Difference]: Finished difference Result 12705 states and 39562 transitions. [2018-12-02 15:22:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:22:24,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 15:22:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:24,829 INFO L225 Difference]: With dead ends: 12705 [2018-12-02 15:22:24,829 INFO L226 Difference]: Without dead ends: 10887 [2018-12-02 15:22:24,829 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 15:22:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-02 15:22:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-02 15:22:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-02 15:22:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33378 transitions. [2018-12-02 15:22:24,937 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33378 transitions. Word has length 54 [2018-12-02 15:22:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:24,937 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33378 transitions. [2018-12-02 15:22:24,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:22:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33378 transitions. [2018-12-02 15:22:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:22:24,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:24,939 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] [2018-12-02 15:22:24,939 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:24,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-02 15:22:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:24,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:24,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:25,053 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 15:22:25,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:25,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:22:25,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:25,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:22:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:22:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:22:25,054 INFO L87 Difference]: Start difference. First operand 10839 states and 33378 transitions. Second operand 4 states. [2018-12-02 15:22:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:25,161 INFO L93 Difference]: Finished difference Result 12386 states and 38207 transitions. [2018-12-02 15:22:25,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:22:25,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 15:22:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:25,174 INFO L225 Difference]: With dead ends: 12386 [2018-12-02 15:22:25,175 INFO L226 Difference]: Without dead ends: 12386 [2018-12-02 15:22:25,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-02 15:22:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-02 15:22:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-02 15:22:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 34991 transitions. [2018-12-02 15:22:25,306 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 34991 transitions. Word has length 61 [2018-12-02 15:22:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:25,307 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 34991 transitions. [2018-12-02 15:22:25,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:22:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 34991 transitions. [2018-12-02 15:22:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:22:25,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:25,309 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] [2018-12-02 15:22:25,309 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:25,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:25,310 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-02 15:22:25,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:25,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:25,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:25,346 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 15:22:25,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:25,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:25,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:25,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:25,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:25,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:25,347 INFO L87 Difference]: Start difference. First operand 11359 states and 34991 transitions. Second operand 6 states. [2018-12-02 15:22:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:25,564 INFO L93 Difference]: Finished difference Result 20935 states and 64392 transitions. [2018-12-02 15:22:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:22:25,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 15:22:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:25,587 INFO L225 Difference]: With dead ends: 20935 [2018-12-02 15:22:25,587 INFO L226 Difference]: Without dead ends: 20864 [2018-12-02 15:22:25,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:22:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-02 15:22:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-02 15:22:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-02 15:22:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40676 transitions. [2018-12-02 15:22:25,770 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40676 transitions. Word has length 61 [2018-12-02 15:22:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:25,770 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40676 transitions. [2018-12-02 15:22:25,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40676 transitions. [2018-12-02 15:22:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:25,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:25,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:25,775 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:25,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-02 15:22:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:25,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:25,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:25,799 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 15:22:25,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:25,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:22:25,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:25,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:22:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:22:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:22:25,799 INFO L87 Difference]: Start difference. First operand 13298 states and 40676 transitions. Second operand 3 states. [2018-12-02 15:22:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:25,927 INFO L93 Difference]: Finished difference Result 13930 states and 42328 transitions. [2018-12-02 15:22:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:22:25,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 15:22:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:25,944 INFO L225 Difference]: With dead ends: 13930 [2018-12-02 15:22:25,944 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 15:22:25,944 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 15:22:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 15:22:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-02 15:22:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-02 15:22:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41502 transitions. [2018-12-02 15:22:26,107 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41502 transitions. Word has length 67 [2018-12-02 15:22:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:26,107 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41502 transitions. [2018-12-02 15:22:26,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:22:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41502 transitions. [2018-12-02 15:22:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:26,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:26,113 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 15:22:26,113 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:26,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-02 15:22:26,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:26,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:26,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:26,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:26,150 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 15:22:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:26,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:22:26,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:26,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:22:26,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:22:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:22:26,151 INFO L87 Difference]: Start difference. First operand 13614 states and 41502 transitions. Second operand 4 states. [2018-12-02 15:22:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:26,315 INFO L93 Difference]: Finished difference Result 17463 states and 52707 transitions. [2018-12-02 15:22:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:22:26,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 15:22:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:26,333 INFO L225 Difference]: With dead ends: 17463 [2018-12-02 15:22:26,333 INFO L226 Difference]: Without dead ends: 17463 [2018-12-02 15:22:26,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 15:22:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-02 15:22:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-02 15:22:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-02 15:22:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46162 transitions. [2018-12-02 15:22:26,508 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46162 transitions. Word has length 67 [2018-12-02 15:22:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:26,508 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46162 transitions. [2018-12-02 15:22:26,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:22:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46162 transitions. [2018-12-02 15:22:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:26,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:26,514 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 15:22:26,514 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:26,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-02 15:22:26,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:26,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:26,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:26,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:26,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:26,556 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 15:22:26,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:26,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:26,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:26,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:26,557 INFO L87 Difference]: Start difference. First operand 15244 states and 46162 transitions. Second operand 6 states. [2018-12-02 15:22:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:27,112 INFO L93 Difference]: Finished difference Result 18862 states and 56070 transitions. [2018-12-02 15:22:27,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:22:27,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 15:22:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:27,132 INFO L225 Difference]: With dead ends: 18862 [2018-12-02 15:22:27,132 INFO L226 Difference]: Without dead ends: 18862 [2018-12-02 15:22:27,132 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 15:22:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-02 15:22:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-02 15:22:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-02 15:22:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53130 transitions. [2018-12-02 15:22:27,319 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53130 transitions. Word has length 67 [2018-12-02 15:22:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:27,320 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53130 transitions. [2018-12-02 15:22:27,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53130 transitions. [2018-12-02 15:22:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:27,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:27,326 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 15:22:27,327 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:27,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:27,327 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-02 15:22:27,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:27,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:27,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:27,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:27,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:27,394 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 15:22:27,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:27,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:27,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:27,395 INFO L87 Difference]: Start difference. First operand 17720 states and 53130 transitions. Second operand 6 states. [2018-12-02 15:22:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:27,629 INFO L93 Difference]: Finished difference Result 20389 states and 59192 transitions. [2018-12-02 15:22:27,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:22:27,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 15:22:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:27,649 INFO L225 Difference]: With dead ends: 20389 [2018-12-02 15:22:27,649 INFO L226 Difference]: Without dead ends: 20389 [2018-12-02 15:22:27,650 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 15:22:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-02 15:22:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-02 15:22:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-02 15:22:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53141 transitions. [2018-12-02 15:22:27,846 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53141 transitions. Word has length 67 [2018-12-02 15:22:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:27,846 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53141 transitions. [2018-12-02 15:22:27,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53141 transitions. [2018-12-02 15:22:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:27,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:27,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] [2018-12-02 15:22:27,853 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-02 15:22:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:27,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:27,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:27,901 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 15:22:27,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:27,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:27,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:27,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:27,901 INFO L87 Difference]: Start difference. First operand 18002 states and 53141 transitions. Second operand 5 states. [2018-12-02 15:22:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:28,097 INFO L93 Difference]: Finished difference Result 23413 states and 68634 transitions. [2018-12-02 15:22:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:22:28,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 15:22:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:28,123 INFO L225 Difference]: With dead ends: 23413 [2018-12-02 15:22:28,123 INFO L226 Difference]: Without dead ends: 23413 [2018-12-02 15:22:28,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 15:22:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-02 15:22:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-02 15:22:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-02 15:22:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62545 transitions. [2018-12-02 15:22:28,359 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62545 transitions. Word has length 67 [2018-12-02 15:22:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:28,359 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62545 transitions. [2018-12-02 15:22:28,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62545 transitions. [2018-12-02 15:22:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:28,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:28,366 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 15:22:28,366 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:28,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-02 15:22:28,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:28,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:28,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:28,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 15:22:28,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:28,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:22:28,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:28,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:22:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:22:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:22:28,400 INFO L87 Difference]: Start difference. First operand 21350 states and 62545 transitions. Second operand 4 states. [2018-12-02 15:22:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:28,712 INFO L93 Difference]: Finished difference Result 26638 states and 78155 transitions. [2018-12-02 15:22:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:22:28,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 15:22:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:28,741 INFO L225 Difference]: With dead ends: 26638 [2018-12-02 15:22:28,741 INFO L226 Difference]: Without dead ends: 26342 [2018-12-02 15:22:28,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2018-12-02 15:22:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 25026. [2018-12-02 15:22:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2018-12-02 15:22:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 73322 transitions. [2018-12-02 15:22:29,038 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 73322 transitions. Word has length 67 [2018-12-02 15:22:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:29,038 INFO L480 AbstractCegarLoop]: Abstraction has 25026 states and 73322 transitions. [2018-12-02 15:22:29,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:22:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 73322 transitions. [2018-12-02 15:22:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:29,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:29,045 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 15:22:29,046 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:29,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-02 15:22:29,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:29,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:29,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:29,111 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 15:22:29,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:29,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 15:22:29,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:29,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:22:29,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:22:29,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:22:29,112 INFO L87 Difference]: Start difference. First operand 25026 states and 73322 transitions. Second operand 9 states. [2018-12-02 15:22:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:29,677 INFO L93 Difference]: Finished difference Result 33549 states and 97842 transitions. [2018-12-02 15:22:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:22:29,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-02 15:22:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:29,712 INFO L225 Difference]: With dead ends: 33549 [2018-12-02 15:22:29,712 INFO L226 Difference]: Without dead ends: 33549 [2018-12-02 15:22:29,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:22:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33549 states. [2018-12-02 15:22:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33549 to 29021. [2018-12-02 15:22:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29021 states. [2018-12-02 15:22:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29021 states to 29021 states and 84668 transitions. [2018-12-02 15:22:30,034 INFO L78 Accepts]: Start accepts. Automaton has 29021 states and 84668 transitions. Word has length 67 [2018-12-02 15:22:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:30,034 INFO L480 AbstractCegarLoop]: Abstraction has 29021 states and 84668 transitions. [2018-12-02 15:22:30,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:22:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29021 states and 84668 transitions. [2018-12-02 15:22:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:30,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:30,042 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 15:22:30,042 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:30,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2142837968, now seen corresponding path program 1 times [2018-12-02 15:22:30,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:30,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:30,067 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 15:22:30,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:30,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:30,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:30,068 INFO L87 Difference]: Start difference. First operand 29021 states and 84668 transitions. Second operand 5 states. [2018-12-02 15:22:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:30,117 INFO L93 Difference]: Finished difference Result 7701 states and 18578 transitions. [2018-12-02 15:22:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:22:30,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 15:22:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:30,124 INFO L225 Difference]: With dead ends: 7701 [2018-12-02 15:22:30,124 INFO L226 Difference]: Without dead ends: 6251 [2018-12-02 15:22:30,124 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 15:22:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2018-12-02 15:22:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 5430. [2018-12-02 15:22:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5430 states. [2018-12-02 15:22:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5430 states to 5430 states and 12664 transitions. [2018-12-02 15:22:30,175 INFO L78 Accepts]: Start accepts. Automaton has 5430 states and 12664 transitions. Word has length 67 [2018-12-02 15:22:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:30,175 INFO L480 AbstractCegarLoop]: Abstraction has 5430 states and 12664 transitions. [2018-12-02 15:22:30,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5430 states and 12664 transitions. [2018-12-02 15:22:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:22:30,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:30,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:30,179 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:30,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-02 15:22:30,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:30,199 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 15:22:30,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:30,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:22:30,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:30,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:22:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:22:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:22:30,200 INFO L87 Difference]: Start difference. First operand 5430 states and 12664 transitions. Second operand 3 states. [2018-12-02 15:22:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:30,222 INFO L93 Difference]: Finished difference Result 7040 states and 16231 transitions. [2018-12-02 15:22:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:22:30,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 15:22:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:30,227 INFO L225 Difference]: With dead ends: 7040 [2018-12-02 15:22:30,227 INFO L226 Difference]: Without dead ends: 7040 [2018-12-02 15:22:30,227 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 15:22:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2018-12-02 15:22:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 5367. [2018-12-02 15:22:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5367 states. [2018-12-02 15:22:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 12202 transitions. [2018-12-02 15:22:30,272 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 12202 transitions. Word has length 67 [2018-12-02 15:22:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:30,272 INFO L480 AbstractCegarLoop]: Abstraction has 5367 states and 12202 transitions. [2018-12-02 15:22:30,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:22:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 12202 transitions. [2018-12-02 15:22:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 15:22:30,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:30,276 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] [2018-12-02 15:22:30,276 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:30,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-02 15:22:30,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:30,322 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 15:22:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:30,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:30,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:30,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:30,322 INFO L87 Difference]: Start difference. First operand 5367 states and 12202 transitions. Second operand 5 states. [2018-12-02 15:22:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:30,406 INFO L93 Difference]: Finished difference Result 6531 states and 14826 transitions. [2018-12-02 15:22:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:22:30,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 15:22:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:30,410 INFO L225 Difference]: With dead ends: 6531 [2018-12-02 15:22:30,410 INFO L226 Difference]: Without dead ends: 6531 [2018-12-02 15:22:30,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:22:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2018-12-02 15:22:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 5811. [2018-12-02 15:22:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5811 states. [2018-12-02 15:22:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 13206 transitions. [2018-12-02 15:22:30,455 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 13206 transitions. Word has length 73 [2018-12-02 15:22:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:30,455 INFO L480 AbstractCegarLoop]: Abstraction has 5811 states and 13206 transitions. [2018-12-02 15:22:30,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 13206 transitions. [2018-12-02 15:22:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 15:22:30,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:30,459 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] [2018-12-02 15:22:30,459 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:30,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-02 15:22:30,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:30,493 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 15:22:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:30,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:30,494 INFO L87 Difference]: Start difference. First operand 5811 states and 13206 transitions. Second operand 7 states. [2018-12-02 15:22:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:30,710 INFO L93 Difference]: Finished difference Result 7005 states and 15751 transitions. [2018-12-02 15:22:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:22:30,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 15:22:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:30,714 INFO L225 Difference]: With dead ends: 7005 [2018-12-02 15:22:30,714 INFO L226 Difference]: Without dead ends: 6886 [2018-12-02 15:22:30,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 15:22:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-12-02 15:22:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 5900. [2018-12-02 15:22:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5900 states. [2018-12-02 15:22:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 13275 transitions. [2018-12-02 15:22:30,758 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 13275 transitions. Word has length 73 [2018-12-02 15:22:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:30,758 INFO L480 AbstractCegarLoop]: Abstraction has 5900 states and 13275 transitions. [2018-12-02 15:22:30,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 13275 transitions. [2018-12-02 15:22:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 15:22:30,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:30,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:30,763 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:30,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-02 15:22:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:30,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:22:30,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:30,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:30,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:30,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:30,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:30,799 INFO L87 Difference]: Start difference. First operand 5900 states and 13275 transitions. Second operand 5 states. [2018-12-02 15:22:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:30,971 INFO L93 Difference]: Finished difference Result 5452 states and 12136 transitions. [2018-12-02 15:22:30,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:22:30,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 15:22:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:30,974 INFO L225 Difference]: With dead ends: 5452 [2018-12-02 15:22:30,974 INFO L226 Difference]: Without dead ends: 5452 [2018-12-02 15:22:30,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 15:22:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2018-12-02 15:22:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5053. [2018-12-02 15:22:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5053 states. [2018-12-02 15:22:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 5053 states and 11230 transitions. [2018-12-02 15:22:31,012 INFO L78 Accepts]: Start accepts. Automaton has 5053 states and 11230 transitions. Word has length 94 [2018-12-02 15:22:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:31,012 INFO L480 AbstractCegarLoop]: Abstraction has 5053 states and 11230 transitions. [2018-12-02 15:22:31,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5053 states and 11230 transitions. [2018-12-02 15:22:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 15:22:31,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:31,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:31,016 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:31,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1331371590, now seen corresponding path program 1 times [2018-12-02 15:22:31,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:31,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:31,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:31,047 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 15:22:31,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:31,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:22:31,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:31,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:22:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:22:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:22:31,048 INFO L87 Difference]: Start difference. First operand 5053 states and 11230 transitions. Second operand 4 states. [2018-12-02 15:22:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:31,100 INFO L93 Difference]: Finished difference Result 6237 states and 13788 transitions. [2018-12-02 15:22:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:22:31,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 15:22:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:31,104 INFO L225 Difference]: With dead ends: 6237 [2018-12-02 15:22:31,104 INFO L226 Difference]: Without dead ends: 6237 [2018-12-02 15:22:31,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 15:22:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6237 states. [2018-12-02 15:22:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6237 to 5468. [2018-12-02 15:22:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-02 15:22:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12154 transitions. [2018-12-02 15:22:31,147 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12154 transitions. Word has length 94 [2018-12-02 15:22:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:31,147 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12154 transitions. [2018-12-02 15:22:31,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:22:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12154 transitions. [2018-12-02 15:22:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:31,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:31,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:31,151 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:31,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:31,151 INFO L82 PathProgramCache]: Analyzing trace with hash 823121319, now seen corresponding path program 1 times [2018-12-02 15:22:31,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:31,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:31,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:31,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:31,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:22:31,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:31,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:31,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:31,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:31,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:31,205 INFO L87 Difference]: Start difference. First operand 5468 states and 12154 transitions. Second operand 7 states. [2018-12-02 15:22:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:31,863 INFO L93 Difference]: Finished difference Result 9300 states and 20771 transitions. [2018-12-02 15:22:31,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 15:22:31,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 15:22:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:31,877 INFO L225 Difference]: With dead ends: 9300 [2018-12-02 15:22:31,877 INFO L226 Difference]: Without dead ends: 9213 [2018-12-02 15:22:31,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-02 15:22:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9213 states. [2018-12-02 15:22:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9213 to 7337. [2018-12-02 15:22:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7337 states. [2018-12-02 15:22:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7337 states to 7337 states and 16445 transitions. [2018-12-02 15:22:31,953 INFO L78 Accepts]: Start accepts. Automaton has 7337 states and 16445 transitions. Word has length 96 [2018-12-02 15:22:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:31,953 INFO L480 AbstractCegarLoop]: Abstraction has 7337 states and 16445 transitions. [2018-12-02 15:22:31,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7337 states and 16445 transitions. [2018-12-02 15:22:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:31,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:31,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:31,958 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1254088024, now seen corresponding path program 1 times [2018-12-02 15:22:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:31,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:31,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:32,020 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 15:22:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:32,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:32,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:32,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:32,021 INFO L87 Difference]: Start difference. First operand 7337 states and 16445 transitions. Second operand 6 states. [2018-12-02 15:22:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:32,161 INFO L93 Difference]: Finished difference Result 6520 states and 14374 transitions. [2018-12-02 15:22:32,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:22:32,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 15:22:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:32,166 INFO L225 Difference]: With dead ends: 6520 [2018-12-02 15:22:32,166 INFO L226 Difference]: Without dead ends: 6500 [2018-12-02 15:22:32,166 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 15:22:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6500 states. [2018-12-02 15:22:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6500 to 5563. [2018-12-02 15:22:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5563 states. [2018-12-02 15:22:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5563 states to 5563 states and 12346 transitions. [2018-12-02 15:22:32,211 INFO L78 Accepts]: Start accepts. Automaton has 5563 states and 12346 transitions. Word has length 96 [2018-12-02 15:22:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:32,211 INFO L480 AbstractCegarLoop]: Abstraction has 5563 states and 12346 transitions. [2018-12-02 15:22:32,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5563 states and 12346 transitions. [2018-12-02 15:22:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:32,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:32,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:32,215 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:32,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1381143353, now seen corresponding path program 1 times [2018-12-02 15:22:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:32,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:32,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:32,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:32,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:32,267 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 15:22:32,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:32,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:32,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:32,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:32,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:32,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:32,268 INFO L87 Difference]: Start difference. First operand 5563 states and 12346 transitions. Second operand 5 states. [2018-12-02 15:22:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:32,488 INFO L93 Difference]: Finished difference Result 6754 states and 14884 transitions. [2018-12-02 15:22:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:22:32,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 15:22:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:32,492 INFO L225 Difference]: With dead ends: 6754 [2018-12-02 15:22:32,492 INFO L226 Difference]: Without dead ends: 6689 [2018-12-02 15:22:32,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 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 15:22:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2018-12-02 15:22:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6215. [2018-12-02 15:22:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2018-12-02 15:22:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 13733 transitions. [2018-12-02 15:22:32,538 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 13733 transitions. Word has length 96 [2018-12-02 15:22:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:32,538 INFO L480 AbstractCegarLoop]: Abstraction has 6215 states and 13733 transitions. [2018-12-02 15:22:32,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 13733 transitions. [2018-12-02 15:22:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:32,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:32,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:32,542 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:32,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:32,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1895732184, now seen corresponding path program 1 times [2018-12-02 15:22:32,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:32,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:32,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:32,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:32,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:32,588 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 15:22:32,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:32,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:22:32,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:32,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:22:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:22:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:22:32,589 INFO L87 Difference]: Start difference. First operand 6215 states and 13733 transitions. Second operand 5 states. [2018-12-02 15:22:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:32,733 INFO L93 Difference]: Finished difference Result 7356 states and 16211 transitions. [2018-12-02 15:22:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:22:32,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 15:22:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:32,738 INFO L225 Difference]: With dead ends: 7356 [2018-12-02 15:22:32,738 INFO L226 Difference]: Without dead ends: 7248 [2018-12-02 15:22:32,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 15:22:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2018-12-02 15:22:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 5775. [2018-12-02 15:22:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5775 states. [2018-12-02 15:22:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 12843 transitions. [2018-12-02 15:22:32,783 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 12843 transitions. Word has length 96 [2018-12-02 15:22:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:32,784 INFO L480 AbstractCegarLoop]: Abstraction has 5775 states and 12843 transitions. [2018-12-02 15:22:32,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:22:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 12843 transitions. [2018-12-02 15:22:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:32,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:32,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:32,787 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:32,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -17003224, now seen corresponding path program 2 times [2018-12-02 15:22:32,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:32,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:32,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:32,856 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 15:22:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:32,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:32,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:32,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:32,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:32,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:32,857 INFO L87 Difference]: Start difference. First operand 5775 states and 12843 transitions. Second operand 7 states. [2018-12-02 15:22:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:33,095 INFO L93 Difference]: Finished difference Result 7146 states and 15871 transitions. [2018-12-02 15:22:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:22:33,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 15:22:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:33,099 INFO L225 Difference]: With dead ends: 7146 [2018-12-02 15:22:33,099 INFO L226 Difference]: Without dead ends: 7146 [2018-12-02 15:22:33,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:22:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2018-12-02 15:22:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 5957. [2018-12-02 15:22:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5957 states. [2018-12-02 15:22:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 13242 transitions. [2018-12-02 15:22:33,144 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 13242 transitions. Word has length 96 [2018-12-02 15:22:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:33,144 INFO L480 AbstractCegarLoop]: Abstraction has 5957 states and 13242 transitions. [2018-12-02 15:22:33,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 13242 transitions. [2018-12-02 15:22:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:33,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:33,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:33,148 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:33,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1970478536, now seen corresponding path program 1 times [2018-12-02 15:22:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:33,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:33,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:22:33,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:33,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:33,245 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 15:22:33,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:33,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 15:22:33,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:33,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:22:33,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:22:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:22:33,246 INFO L87 Difference]: Start difference. First operand 5957 states and 13242 transitions. Second operand 9 states. [2018-12-02 15:22:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:33,637 INFO L93 Difference]: Finished difference Result 6448 states and 14298 transitions. [2018-12-02 15:22:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:22:33,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 15:22:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:33,642 INFO L225 Difference]: With dead ends: 6448 [2018-12-02 15:22:33,642 INFO L226 Difference]: Without dead ends: 6441 [2018-12-02 15:22:33,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:22:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-02 15:22:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5996. [2018-12-02 15:22:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2018-12-02 15:22:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13325 transitions. [2018-12-02 15:22:33,699 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13325 transitions. Word has length 96 [2018-12-02 15:22:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:33,699 INFO L480 AbstractCegarLoop]: Abstraction has 5996 states and 13325 transitions. [2018-12-02 15:22:33,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:22:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13325 transitions. [2018-12-02 15:22:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:33,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:33,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:33,704 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:33,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:33,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2018-12-02 15:22:33,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:33,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:33,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:33,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:33,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:33,751 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 15:22:33,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:33,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:33,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:33,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:33,752 INFO L87 Difference]: Start difference. First operand 5996 states and 13325 transitions. Second operand 6 states. [2018-12-02 15:22:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:33,888 INFO L93 Difference]: Finished difference Result 6062 states and 13404 transitions. [2018-12-02 15:22:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:22:33,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 15:22:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:33,892 INFO L225 Difference]: With dead ends: 6062 [2018-12-02 15:22:33,892 INFO L226 Difference]: Without dead ends: 6062 [2018-12-02 15:22:33,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:22:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2018-12-02 15:22:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 5749. [2018-12-02 15:22:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5749 states. [2018-12-02 15:22:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5749 states to 5749 states and 12754 transitions. [2018-12-02 15:22:33,946 INFO L78 Accepts]: Start accepts. Automaton has 5749 states and 12754 transitions. Word has length 96 [2018-12-02 15:22:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:33,946 INFO L480 AbstractCegarLoop]: Abstraction has 5749 states and 12754 transitions. [2018-12-02 15:22:33,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5749 states and 12754 transitions. [2018-12-02 15:22:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:33,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:33,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, 1, 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 15:22:33,952 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:33,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1123855095, now seen corresponding path program 1 times [2018-12-02 15:22:33,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:33,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:33,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:34,007 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 15:22:34,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:34,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:34,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:34,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:34,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:34,008 INFO L87 Difference]: Start difference. First operand 5749 states and 12754 transitions. Second operand 6 states. [2018-12-02 15:22:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:34,199 INFO L93 Difference]: Finished difference Result 6941 states and 15369 transitions. [2018-12-02 15:22:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:22:34,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 15:22:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:34,204 INFO L225 Difference]: With dead ends: 6941 [2018-12-02 15:22:34,204 INFO L226 Difference]: Without dead ends: 6941 [2018-12-02 15:22:34,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:22:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2018-12-02 15:22:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 5775. [2018-12-02 15:22:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5775 states. [2018-12-02 15:22:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 12796 transitions. [2018-12-02 15:22:34,250 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 12796 transitions. Word has length 96 [2018-12-02 15:22:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:34,251 INFO L480 AbstractCegarLoop]: Abstraction has 5775 states and 12796 transitions. [2018-12-02 15:22:34,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 12796 transitions. [2018-12-02 15:22:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:34,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:34,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:34,254 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:34,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1105218985, now seen corresponding path program 1 times [2018-12-02 15:22:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:34,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:34,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:34,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:34,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:34,303 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 15:22:34,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:34,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:34,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:34,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:34,303 INFO L87 Difference]: Start difference. First operand 5775 states and 12796 transitions. Second operand 7 states. [2018-12-02 15:22:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:34,519 INFO L93 Difference]: Finished difference Result 7164 states and 15829 transitions. [2018-12-02 15:22:34,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:22:34,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 15:22:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:34,523 INFO L225 Difference]: With dead ends: 7164 [2018-12-02 15:22:34,523 INFO L226 Difference]: Without dead ends: 7164 [2018-12-02 15:22:34,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-02 15:22:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7164 states. [2018-12-02 15:22:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7164 to 6539. [2018-12-02 15:22:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6539 states. [2018-12-02 15:22:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 14436 transitions. [2018-12-02 15:22:34,572 INFO L78 Accepts]: Start accepts. Automaton has 6539 states and 14436 transitions. Word has length 96 [2018-12-02 15:22:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:34,572 INFO L480 AbstractCegarLoop]: Abstraction has 6539 states and 14436 transitions. [2018-12-02 15:22:34,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 14436 transitions. [2018-12-02 15:22:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:34,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:34,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:34,576 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:34,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1202266551, now seen corresponding path program 1 times [2018-12-02 15:22:34,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:34,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:34,669 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 15:22:34,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:34,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 15:22:34,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:34,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 15:22:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:22:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:22:34,669 INFO L87 Difference]: Start difference. First operand 6539 states and 14436 transitions. Second operand 8 states. [2018-12-02 15:22:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:34,863 INFO L93 Difference]: Finished difference Result 7308 states and 15901 transitions. [2018-12-02 15:22:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:22:34,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 15:22:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:34,867 INFO L225 Difference]: With dead ends: 7308 [2018-12-02 15:22:34,867 INFO L226 Difference]: Without dead ends: 7308 [2018-12-02 15:22:34,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:22:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2018-12-02 15:22:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 6551. [2018-12-02 15:22:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6551 states. [2018-12-02 15:22:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6551 states to 6551 states and 14365 transitions. [2018-12-02 15:22:34,920 INFO L78 Accepts]: Start accepts. Automaton has 6551 states and 14365 transitions. Word has length 96 [2018-12-02 15:22:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:34,920 INFO L480 AbstractCegarLoop]: Abstraction has 6551 states and 14365 transitions. [2018-12-02 15:22:34,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 15:22:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6551 states and 14365 transitions. [2018-12-02 15:22:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:34,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:34,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:34,926 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:34,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2018-12-02 15:22:34,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:34,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:34,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:35,014 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 15:22:35,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:35,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 15:22:35,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:35,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 15:22:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:22:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:22:35,015 INFO L87 Difference]: Start difference. First operand 6551 states and 14365 transitions. Second operand 12 states. [2018-12-02 15:22:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:35,500 INFO L93 Difference]: Finished difference Result 8291 states and 18043 transitions. [2018-12-02 15:22:35,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 15:22:35,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 15:22:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:35,506 INFO L225 Difference]: With dead ends: 8291 [2018-12-02 15:22:35,506 INFO L226 Difference]: Without dead ends: 8291 [2018-12-02 15:22:35,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-12-02 15:22:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2018-12-02 15:22:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 7056. [2018-12-02 15:22:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7056 states. [2018-12-02 15:22:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7056 states to 7056 states and 15461 transitions. [2018-12-02 15:22:35,561 INFO L78 Accepts]: Start accepts. Automaton has 7056 states and 15461 transitions. Word has length 96 [2018-12-02 15:22:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:35,561 INFO L480 AbstractCegarLoop]: Abstraction has 7056 states and 15461 transitions. [2018-12-02 15:22:35,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 15:22:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7056 states and 15461 transitions. [2018-12-02 15:22:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:35,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:35,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:35,566 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:35,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2018-12-02 15:22:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:35,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:35,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:35,662 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 15:22:35,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:35,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 15:22:35,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:35,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:22:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:22:35,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:22:35,662 INFO L87 Difference]: Start difference. First operand 7056 states and 15461 transitions. Second operand 11 states. [2018-12-02 15:22:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:36,472 INFO L93 Difference]: Finished difference Result 13320 states and 29527 transitions. [2018-12-02 15:22:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 15:22:36,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 15:22:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:36,478 INFO L225 Difference]: With dead ends: 13320 [2018-12-02 15:22:36,478 INFO L226 Difference]: Without dead ends: 8526 [2018-12-02 15:22:36,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:22:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-02 15:22:36,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 6372. [2018-12-02 15:22:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6372 states. [2018-12-02 15:22:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6372 states to 6372 states and 13963 transitions. [2018-12-02 15:22:36,528 INFO L78 Accepts]: Start accepts. Automaton has 6372 states and 13963 transitions. Word has length 96 [2018-12-02 15:22:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:36,528 INFO L480 AbstractCegarLoop]: Abstraction has 6372 states and 13963 transitions. [2018-12-02 15:22:36,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:22:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6372 states and 13963 transitions. [2018-12-02 15:22:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:36,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:36,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:36,533 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:36,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash 700839058, now seen corresponding path program 1 times [2018-12-02 15:22:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:36,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:36,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:36,616 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 15:22:36,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:36,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:36,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:36,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:36,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:36,617 INFO L87 Difference]: Start difference. First operand 6372 states and 13963 transitions. Second operand 7 states. [2018-12-02 15:22:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:36,817 INFO L93 Difference]: Finished difference Result 8437 states and 18372 transitions. [2018-12-02 15:22:36,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:22:36,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 15:22:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:36,823 INFO L225 Difference]: With dead ends: 8437 [2018-12-02 15:22:36,823 INFO L226 Difference]: Without dead ends: 8413 [2018-12-02 15:22:36,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:22:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8413 states. [2018-12-02 15:22:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8413 to 6740. [2018-12-02 15:22:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6740 states. [2018-12-02 15:22:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 14770 transitions. [2018-12-02 15:22:36,884 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 14770 transitions. Word has length 96 [2018-12-02 15:22:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:36,884 INFO L480 AbstractCegarLoop]: Abstraction has 6740 states and 14770 transitions. [2018-12-02 15:22:36,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 14770 transitions. [2018-12-02 15:22:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:36,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:36,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:36,889 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:36,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash 186250227, now seen corresponding path program 1 times [2018-12-02 15:22:36,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:36,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:36,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:36,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:36,938 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 15:22:36,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:36,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:22:36,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:36,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:22:36,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:22:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:22:36,939 INFO L87 Difference]: Start difference. First operand 6740 states and 14770 transitions. Second operand 6 states. [2018-12-02 15:22:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:37,115 INFO L93 Difference]: Finished difference Result 7966 states and 17525 transitions. [2018-12-02 15:22:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:22:37,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 15:22:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:37,120 INFO L225 Difference]: With dead ends: 7966 [2018-12-02 15:22:37,120 INFO L226 Difference]: Without dead ends: 7966 [2018-12-02 15:22:37,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:22:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7966 states. [2018-12-02 15:22:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7966 to 6916. [2018-12-02 15:22:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6916 states. [2018-12-02 15:22:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 15139 transitions. [2018-12-02 15:22:37,171 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 15139 transitions. Word has length 96 [2018-12-02 15:22:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:37,171 INFO L480 AbstractCegarLoop]: Abstraction has 6916 states and 15139 transitions. [2018-12-02 15:22:37,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:22:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 15139 transitions. [2018-12-02 15:22:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:37,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:37,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:37,176 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:37,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash -164379470, now seen corresponding path program 1 times [2018-12-02 15:22:37,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:37,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:37,287 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 15:22:37,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 15:22:37,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:37,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:22:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:22:37,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:22:37,288 INFO L87 Difference]: Start difference. First operand 6916 states and 15139 transitions. Second operand 9 states. [2018-12-02 15:22:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:37,614 INFO L93 Difference]: Finished difference Result 8301 states and 17949 transitions. [2018-12-02 15:22:37,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:22:37,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 15:22:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:37,620 INFO L225 Difference]: With dead ends: 8301 [2018-12-02 15:22:37,620 INFO L226 Difference]: Without dead ends: 8301 [2018-12-02 15:22:37,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:22:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2018-12-02 15:22:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 7274. [2018-12-02 15:22:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7274 states. [2018-12-02 15:22:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7274 states to 7274 states and 15872 transitions. [2018-12-02 15:22:37,676 INFO L78 Accepts]: Start accepts. Automaton has 7274 states and 15872 transitions. Word has length 96 [2018-12-02 15:22:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:37,676 INFO L480 AbstractCegarLoop]: Abstraction has 7274 states and 15872 transitions. [2018-12-02 15:22:37,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:22:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7274 states and 15872 transitions. [2018-12-02 15:22:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:37,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:37,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:37,682 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:37,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1003094195, now seen corresponding path program 2 times [2018-12-02 15:22:37,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:22:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:37,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:37,745 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 15:22:37,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:37,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:22:37,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:37,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:22:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:22:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:22:37,746 INFO L87 Difference]: Start difference. First operand 7274 states and 15872 transitions. Second operand 7 states. [2018-12-02 15:22:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:37,837 INFO L93 Difference]: Finished difference Result 9398 states and 20639 transitions. [2018-12-02 15:22:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:22:37,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 15:22:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:37,842 INFO L225 Difference]: With dead ends: 9398 [2018-12-02 15:22:37,842 INFO L226 Difference]: Without dead ends: 9398 [2018-12-02 15:22:37,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:22:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9398 states. [2018-12-02 15:22:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9398 to 6461. [2018-12-02 15:22:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6461 states. [2018-12-02 15:22:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 14079 transitions. [2018-12-02 15:22:37,896 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 14079 transitions. Word has length 96 [2018-12-02 15:22:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:37,896 INFO L480 AbstractCegarLoop]: Abstraction has 6461 states and 14079 transitions. [2018-12-02 15:22:37,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:22:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 14079 transitions. [2018-12-02 15:22:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:37,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:37,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:37,901 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:37,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1696195892, now seen corresponding path program 2 times [2018-12-02 15:22:37,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:37,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:37,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:22:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:37,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:22:38,005 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 15:22:38,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:22:38,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 15:22:38,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:22:38,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:22:38,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:22:38,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:22:38,006 INFO L87 Difference]: Start difference. First operand 6461 states and 14079 transitions. Second operand 11 states. [2018-12-02 15:22:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:22:38,462 INFO L93 Difference]: Finished difference Result 8369 states and 18338 transitions. [2018-12-02 15:22:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 15:22:38,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 15:22:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:22:38,468 INFO L225 Difference]: With dead ends: 8369 [2018-12-02 15:22:38,469 INFO L226 Difference]: Without dead ends: 8369 [2018-12-02 15:22:38,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:22:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2018-12-02 15:22:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 6471. [2018-12-02 15:22:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6471 states. [2018-12-02 15:22:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6471 states to 6471 states and 14100 transitions. [2018-12-02 15:22:38,522 INFO L78 Accepts]: Start accepts. Automaton has 6471 states and 14100 transitions. Word has length 96 [2018-12-02 15:22:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:22:38,522 INFO L480 AbstractCegarLoop]: Abstraction has 6471 states and 14100 transitions. [2018-12-02 15:22:38,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:22:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6471 states and 14100 transitions. [2018-12-02 15:22:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 15:22:38,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:22:38,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:22:38,527 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:22:38,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:22:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-02 15:22:38,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:22:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:38,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:22:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:22:38,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:22:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:22:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:22:38,564 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 15:22:38,628 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 15:22:38,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:22:38 BasicIcfg [2018-12-02 15:22:38,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:22:38,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:22:38,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:22:38,629 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:22:38,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:22:08" (3/4) ... [2018-12-02 15:22:38,631 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 15:22:38,702 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bbd7293e-4364-4beb-bfa7-aaf459d736bc/bin-2019/utaipan/witness.graphml [2018-12-02 15:22:38,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:22:38,703 INFO L168 Benchmark]: Toolchain (without parser) took 31373.12 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 953.4 MB in the beginning and 1.9 GB in the end (delta: -978.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-02 15:22:38,703 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 15:22:38,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:22:38,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.82 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:22:38,704 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 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 15:22:38,704 INFO L168 Benchmark]: RCFGBuilder took 343.30 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:22:38,704 INFO L168 Benchmark]: TraceAbstraction took 30585.51 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -932.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 15:22:38,704 INFO L168 Benchmark]: Witness Printer took 73.23 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:22:38,705 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 314.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.82 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 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 343.30 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30585.51 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -932.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 73.23 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t307; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t308; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_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] [L755] 1 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 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_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] [L757] 1 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 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -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) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -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 [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -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 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 30.5s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11803 SDtfs, 13560 SDslu, 30236 SDs, 0 SdLazy, 14363 SolverSat, 635 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 111 SyntacticMatches, 52 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 12.0s AutomataMinimizationTime, 42 MinimizatonAttempts, 197161 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3283 NumberOfCodeBlocks, 3283 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3145 ConstructedInterpolants, 0 QuantifiedInterpolants, 789085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...