./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/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 329b7a48e556584de8d61f30845ded50594e4269 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 19:50:42,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:50:42,801 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:50:42,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:50:42,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:50:42,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:50:42,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:50:42,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:50:42,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:50:42,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:50:42,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:50:42,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:50:42,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:50:42,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:50:42,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:50:42,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:50:42,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:50:42,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:50:42,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:50:42,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:50:42,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:50:42,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:50:42,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:50:42,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:50:42,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:50:42,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:50:42,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:50:42,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:50:42,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:50:42,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:50:42,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:50:42,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:50:42,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:50:42,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:50:42,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:50:42,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:50:42,830 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:50:42,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:50:42,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:50:42,838 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:50:42,838 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:50:42,838 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:50:42,838 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:50:42,838 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:50:42,838 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:50:42,838 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:50:42,838 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:50:42,839 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:50:42,839 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:50:42,839 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:50:42,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:50:42,839 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:50:42,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:50:42,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:50:42,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:50:42,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:50:42,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:50:42,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:50:42,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:50:42,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:50:42,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:50:42,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:50:42,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:50:42,842 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:50:42,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:50:42,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:50:42,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:50:42,842 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_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/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 -> 329b7a48e556584de8d61f30845ded50594e4269 [2018-12-08 19:50:42,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:50:42,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:50:42,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:50:42,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:50:42,879 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:50:42,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-08 19:50:42,914 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/data/645ad663b/14dd8040b89e41958e62428a9d89f4d5/FLAGcc267f64d [2018-12-08 19:50:43,383 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:50:43,384 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-08 19:50:43,390 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/data/645ad663b/14dd8040b89e41958e62428a9d89f4d5/FLAGcc267f64d [2018-12-08 19:50:43,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/data/645ad663b/14dd8040b89e41958e62428a9d89f4d5 [2018-12-08 19:50:43,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:50:43,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:50:43,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:50:43,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:50:43,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:50:43,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43, skipping insertion in model container [2018-12-08 19:50:43,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:50:43,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:50:43,609 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:50:43,617 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:50:43,684 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:50:43,713 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:50:43,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43 WrapperNode [2018-12-08 19:50:43,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:50:43,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:50:43,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:50:43,714 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:50:43,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:50:43,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:50:43,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:50:43,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:50:43,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... [2018-12-08 19:50:43,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:50:43,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:50:43,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:50:43,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:50:43,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/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-08 19:50:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 19:50:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 19:50:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 19:50:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 19:50:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 19:50:43,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 19:50:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 19:50:43,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 19:50:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 19:50:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:50:43,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:50:43,803 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 19:50:44,104 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:50:44,104 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 19:50:44,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:50:44 BoogieIcfgContainer [2018-12-08 19:50:44,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:50:44,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:50:44,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:50:44,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:50:44,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:50:43" (1/3) ... [2018-12-08 19:50:44,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0cdca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:50:44, skipping insertion in model container [2018-12-08 19:50:44,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:43" (2/3) ... [2018-12-08 19:50:44,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0cdca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:50:44, skipping insertion in model container [2018-12-08 19:50:44,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:50:44" (3/3) ... [2018-12-08 19:50:44,109 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt_false-unreach-call.i [2018-12-08 19:50:44,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,133 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,133 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,133 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,134 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,135 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,136 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,137 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,139 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:50:44,148 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 19:50:44,148 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:50:44,155 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 19:50:44,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 19:50:44,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:50:44,184 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:50:44,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:50:44,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:50:44,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:50:44,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:50:44,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:50:44,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:50:44,193 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-08 19:50:45,222 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-08 19:50:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-08 19:50:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 19:50:45,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:45,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:45,230 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:45,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:45,234 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-08 19:50:45,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:45,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:45,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:45,378 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-08 19:50:45,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:50:45,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:45,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:50:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:50:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:45,392 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-08 19:50:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:45,774 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-08 19:50:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:50:45,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-08 19:50:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:45,931 INFO L225 Difference]: With dead ends: 45389 [2018-12-08 19:50:45,931 INFO L226 Difference]: Without dead ends: 40629 [2018-12-08 19:50:45,932 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-08 19:50:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-08 19:50:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-08 19:50:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-08 19:50:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-08 19:50:46,625 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-08 19:50:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:46,626 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-08 19:50:46,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:50:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-08 19:50:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 19:50:46,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:46,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:46,629 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:46,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-08 19:50:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:46,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:46,664 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-08 19:50:46,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:46,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:50:46,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:46,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:46,666 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-08 19:50:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:46,783 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-08 19:50:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:46,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-08 19:50:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:46,844 INFO L225 Difference]: With dead ends: 23663 [2018-12-08 19:50:46,844 INFO L226 Difference]: Without dead ends: 23663 [2018-12-08 19:50:46,845 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-08 19:50:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-08 19:50:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-08 19:50:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-08 19:50:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-08 19:50:47,290 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-08 19:50:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:47,291 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-08 19:50:47,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-08 19:50:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 19:50:47,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:47,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:47,293 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:47,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-08 19:50:47,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:47,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:47,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:47,340 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-08 19:50:47,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:47,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:50:47,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:47,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:50:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:50:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:50:47,341 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-08 19:50:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:47,910 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-08 19:50:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:50:47,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-08 19:50:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:48,026 INFO L225 Difference]: With dead ends: 64831 [2018-12-08 19:50:48,026 INFO L226 Difference]: Without dead ends: 64671 [2018-12-08 19:50:48,026 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-08 19:50:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-08 19:50:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-08 19:50:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-08 19:50:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-08 19:50:48,775 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-08 19:50:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:48,776 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-08 19:50:48,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:50:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-08 19:50:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 19:50:48,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:48,778 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-08 19:50:48,779 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:48,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-08 19:50:48,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:48,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:48,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:48,815 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-08 19:50:48,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:48,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:50:48,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:48,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:48,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:48,816 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-08 19:50:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:49,063 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-08 19:50:49,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:49,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-08 19:50:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:49,131 INFO L225 Difference]: With dead ends: 37143 [2018-12-08 19:50:49,132 INFO L226 Difference]: Without dead ends: 37143 [2018-12-08 19:50:49,132 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-08 19:50:49,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-08 19:50:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-08 19:50:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-08 19:50:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-08 19:50:49,655 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-08 19:50:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:49,655 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-08 19:50:49,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-08 19:50:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 19:50:49,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:49,657 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-08 19:50:49,657 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:49,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-08 19:50:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:49,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:49,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:49,696 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-08 19:50:49,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:49,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:50:49,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:49,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:50:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:50:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:50:49,697 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-08 19:50:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:50,161 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-08 19:50:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:50:50,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 19:50:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:50,274 INFO L225 Difference]: With dead ends: 66627 [2018-12-08 19:50:50,274 INFO L226 Difference]: Without dead ends: 66459 [2018-12-08 19:50:50,275 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-08 19:50:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-08 19:50:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-08 19:50:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-08 19:50:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-08 19:50:50,969 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-08 19:50:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:50,969 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-08 19:50:50,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:50:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-08 19:50:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 19:50:50,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:50,975 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-08 19:50:50,975 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:50,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-08 19:50:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:50,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:50,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:50:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:50:51,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:51,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:50:51,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:50:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:51,010 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-08 19:50:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:51,066 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-08 19:50:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:50:51,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-08 19:50:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:51,084 INFO L225 Difference]: With dead ends: 14217 [2018-12-08 19:50:51,084 INFO L226 Difference]: Without dead ends: 13696 [2018-12-08 19:50:51,084 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-08 19:50:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-08 19:50:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-08 19:50:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-08 19:50:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-08 19:50:51,234 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-08 19:50:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:51,235 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-08 19:50:51,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:50:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-08 19:50:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 19:50:51,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:51,237 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] [2018-12-08 19:50:51,237 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:51,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-08 19:50:51,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:51,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:51,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-08 19:50:51,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:51,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:50:51,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:51,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:50:51,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:50:51,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:51,288 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-08 19:50:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:51,443 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-08 19:50:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:50:51,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-08 19:50:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:51,470 INFO L225 Difference]: With dead ends: 19084 [2018-12-08 19:50:51,470 INFO L226 Difference]: Without dead ends: 19084 [2018-12-08 19:50:51,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 19:50:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-08 19:50:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-08 19:50:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-08 19:50:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-08 19:50:51,651 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-08 19:50:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:51,651 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-08 19:50:51,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:50:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-08 19:50:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 19:50:51,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:51,654 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] [2018-12-08 19:50:51,655 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:51,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-08 19:50:51,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:51,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:51,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:51,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:51,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:51,712 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-08 19:50:51,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:51,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:50:51,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:51,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:50:51,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:50:51,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:51,714 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-08 19:50:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:52,130 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-08 19:50:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:50:52,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-08 19:50:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:52,153 INFO L225 Difference]: With dead ends: 20683 [2018-12-08 19:50:52,154 INFO L226 Difference]: Without dead ends: 20683 [2018-12-08 19:50:52,154 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-08 19:50:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-08 19:50:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-08 19:50:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-08 19:50:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-08 19:50:52,359 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-08 19:50:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:52,360 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-08 19:50:52,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:50:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-08 19:50:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 19:50:52,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:52,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:52,363 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:52,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-08 19:50:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:52,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:50:52,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:52,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:50:52,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:52,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:50:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:50:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:50:52,407 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 6 states. [2018-12-08 19:50:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:52,734 INFO L93 Difference]: Finished difference Result 24160 states and 78371 transitions. [2018-12-08 19:50:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 19:50:52,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-08 19:50:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:52,764 INFO L225 Difference]: With dead ends: 24160 [2018-12-08 19:50:52,764 INFO L226 Difference]: Without dead ends: 24128 [2018-12-08 19:50:52,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 19:50:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24128 states. [2018-12-08 19:50:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24128 to 18248. [2018-12-08 19:50:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2018-12-08 19:50:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 59757 transitions. [2018-12-08 19:50:52,990 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 59757 transitions. Word has length 59 [2018-12-08 19:50:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:52,991 INFO L480 AbstractCegarLoop]: Abstraction has 18248 states and 59757 transitions. [2018-12-08 19:50:52,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:50:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 59757 transitions. [2018-12-08 19:50:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 19:50:53,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:53,002 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-08 19:50:53,002 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:53,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash 508362432, now seen corresponding path program 1 times [2018-12-08 19:50:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:53,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:53,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:53,049 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-08 19:50:53,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:50:53,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:50:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:50:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:53,050 INFO L87 Difference]: Start difference. First operand 18248 states and 59757 transitions. Second operand 4 states. [2018-12-08 19:50:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:53,336 INFO L93 Difference]: Finished difference Result 29316 states and 94246 transitions. [2018-12-08 19:50:53,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:50:53,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-08 19:50:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:53,373 INFO L225 Difference]: With dead ends: 29316 [2018-12-08 19:50:53,373 INFO L226 Difference]: Without dead ends: 29120 [2018-12-08 19:50:53,373 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-08 19:50:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2018-12-08 19:50:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 24768. [2018-12-08 19:50:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24768 states. [2018-12-08 19:50:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24768 states to 24768 states and 80579 transitions. [2018-12-08 19:50:53,678 INFO L78 Accepts]: Start accepts. Automaton has 24768 states and 80579 transitions. Word has length 73 [2018-12-08 19:50:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:53,678 INFO L480 AbstractCegarLoop]: Abstraction has 24768 states and 80579 transitions. [2018-12-08 19:50:53,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:50:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24768 states and 80579 transitions. [2018-12-08 19:50:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 19:50:53,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:53,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:53,693 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:53,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1861672129, now seen corresponding path program 1 times [2018-12-08 19:50:53,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:53,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:53,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:53,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:53,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:53,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-08 19:50:53,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:53,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:50:53,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:53,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:50:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:50:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:50:53,773 INFO L87 Difference]: Start difference. First operand 24768 states and 80579 transitions. Second operand 8 states. [2018-12-08 19:50:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:54,474 INFO L93 Difference]: Finished difference Result 37722 states and 118602 transitions. [2018-12-08 19:50:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 19:50:54,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-08 19:50:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:54,516 INFO L225 Difference]: With dead ends: 37722 [2018-12-08 19:50:54,516 INFO L226 Difference]: Without dead ends: 37474 [2018-12-08 19:50:54,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:50:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37474 states. [2018-12-08 19:50:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37474 to 27365. [2018-12-08 19:50:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27365 states. [2018-12-08 19:50:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27365 states to 27365 states and 88367 transitions. [2018-12-08 19:50:54,871 INFO L78 Accepts]: Start accepts. Automaton has 27365 states and 88367 transitions. Word has length 73 [2018-12-08 19:50:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:54,871 INFO L480 AbstractCegarLoop]: Abstraction has 27365 states and 88367 transitions. [2018-12-08 19:50:54,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:50:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27365 states and 88367 transitions. [2018-12-08 19:50:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 19:50:54,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:54,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] [2018-12-08 19:50:54,889 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:54,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1568269122, now seen corresponding path program 1 times [2018-12-08 19:50:54,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:54,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:54,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:54,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:54,948 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-08 19:50:54,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:54,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:50:54,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:54,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:50:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:50:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:50:54,949 INFO L87 Difference]: Start difference. First operand 27365 states and 88367 transitions. Second operand 8 states. [2018-12-08 19:50:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:55,654 INFO L93 Difference]: Finished difference Result 34993 states and 111268 transitions. [2018-12-08 19:50:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 19:50:55,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-08 19:50:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:55,699 INFO L225 Difference]: With dead ends: 34993 [2018-12-08 19:50:55,699 INFO L226 Difference]: Without dead ends: 34929 [2018-12-08 19:50:55,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-08 19:50:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34929 states. [2018-12-08 19:50:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34929 to 29457. [2018-12-08 19:50:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29457 states. [2018-12-08 19:50:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 94772 transitions. [2018-12-08 19:50:56,065 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 94772 transitions. Word has length 73 [2018-12-08 19:50:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:56,066 INFO L480 AbstractCegarLoop]: Abstraction has 29457 states and 94772 transitions. [2018-12-08 19:50:56,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:50:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 94772 transitions. [2018-12-08 19:50:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 19:50:56,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:56,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:56,087 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:56,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 749030577, now seen corresponding path program 1 times [2018-12-08 19:50:56,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:56,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:56,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:56,114 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-08 19:50:56,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:50:56,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:56,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:56,115 INFO L87 Difference]: Start difference. First operand 29457 states and 94772 transitions. Second operand 3 states. [2018-12-08 19:50:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:56,218 INFO L93 Difference]: Finished difference Result 34177 states and 108640 transitions. [2018-12-08 19:50:56,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:56,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-08 19:50:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:56,258 INFO L225 Difference]: With dead ends: 34177 [2018-12-08 19:50:56,258 INFO L226 Difference]: Without dead ends: 34177 [2018-12-08 19:50:56,258 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-08 19:50:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34177 states. [2018-12-08 19:50:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34177 to 31025. [2018-12-08 19:50:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31025 states. [2018-12-08 19:50:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31025 states to 31025 states and 99252 transitions. [2018-12-08 19:50:56,626 INFO L78 Accepts]: Start accepts. Automaton has 31025 states and 99252 transitions. Word has length 75 [2018-12-08 19:50:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:56,627 INFO L480 AbstractCegarLoop]: Abstraction has 31025 states and 99252 transitions. [2018-12-08 19:50:56,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31025 states and 99252 transitions. [2018-12-08 19:50:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 19:50:56,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:56,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:56,651 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:56,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1031472080, now seen corresponding path program 1 times [2018-12-08 19:50:56,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:56,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:56,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:56,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:56,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:50:56,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:56,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 19:50:56,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:56,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 19:50:56,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:50:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:50:56,782 INFO L87 Difference]: Start difference. First operand 31025 states and 99252 transitions. Second operand 10 states. [2018-12-08 19:50:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:57,828 INFO L93 Difference]: Finished difference Result 40629 states and 126835 transitions. [2018-12-08 19:50:57,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 19:50:57,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-08 19:50:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:57,880 INFO L225 Difference]: With dead ends: 40629 [2018-12-08 19:50:57,880 INFO L226 Difference]: Without dead ends: 40565 [2018-12-08 19:50:57,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 19:50:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40565 states. [2018-12-08 19:50:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40565 to 33477. [2018-12-08 19:50:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33477 states. [2018-12-08 19:50:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 106323 transitions. [2018-12-08 19:50:58,255 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 106323 transitions. Word has length 79 [2018-12-08 19:50:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:58,255 INFO L480 AbstractCegarLoop]: Abstraction has 33477 states and 106323 transitions. [2018-12-08 19:50:58,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 19:50:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 106323 transitions. [2018-12-08 19:50:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 19:50:58,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:58,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:58,280 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -341105651, now seen corresponding path program 1 times [2018-12-08 19:50:58,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:58,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:58,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:50:58,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:58,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:50:58,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:58,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:50:58,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:50:58,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:58,305 INFO L87 Difference]: Start difference. First operand 33477 states and 106323 transitions. Second operand 4 states. [2018-12-08 19:50:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:58,574 INFO L93 Difference]: Finished difference Result 39513 states and 123931 transitions. [2018-12-08 19:50:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:50:58,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 19:50:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:58,623 INFO L225 Difference]: With dead ends: 39513 [2018-12-08 19:50:58,623 INFO L226 Difference]: Without dead ends: 39273 [2018-12-08 19:50:58,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:50:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39273 states. [2018-12-08 19:50:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39273 to 37605. [2018-12-08 19:50:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37605 states. [2018-12-08 19:50:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37605 states to 37605 states and 118468 transitions. [2018-12-08 19:50:59,033 INFO L78 Accepts]: Start accepts. Automaton has 37605 states and 118468 transitions. Word has length 81 [2018-12-08 19:50:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:59,033 INFO L480 AbstractCegarLoop]: Abstraction has 37605 states and 118468 transitions. [2018-12-08 19:50:59,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:50:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37605 states and 118468 transitions. [2018-12-08 19:50:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 19:50:59,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:59,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:59,062 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:59,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2018201358, now seen corresponding path program 1 times [2018-12-08 19:50:59,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:59,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:59,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:59,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:59,081 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-08 19:50:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:59,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:50:59,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:59,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:59,082 INFO L87 Difference]: Start difference. First operand 37605 states and 118468 transitions. Second operand 3 states. [2018-12-08 19:50:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:59,300 INFO L93 Difference]: Finished difference Result 39589 states and 124426 transitions. [2018-12-08 19:50:59,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:59,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-08 19:50:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:59,349 INFO L225 Difference]: With dead ends: 39589 [2018-12-08 19:50:59,350 INFO L226 Difference]: Without dead ends: 39589 [2018-12-08 19:50:59,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39589 states. [2018-12-08 19:50:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39589 to 38593. [2018-12-08 19:50:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38593 states. [2018-12-08 19:50:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38593 states to 38593 states and 121424 transitions. [2018-12-08 19:50:59,774 INFO L78 Accepts]: Start accepts. Automaton has 38593 states and 121424 transitions. Word has length 81 [2018-12-08 19:50:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:59,775 INFO L480 AbstractCegarLoop]: Abstraction has 38593 states and 121424 transitions. [2018-12-08 19:50:59,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38593 states and 121424 transitions. [2018-12-08 19:50:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 19:50:59,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:59,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:50:59,803 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:59,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash -259330474, now seen corresponding path program 1 times [2018-12-08 19:50:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:59,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:59,844 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-08 19:50:59,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:59,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:50:59,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:59,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:59,846 INFO L87 Difference]: Start difference. First operand 38593 states and 121424 transitions. Second operand 3 states. [2018-12-08 19:50:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:59,939 INFO L93 Difference]: Finished difference Result 36440 states and 112816 transitions. [2018-12-08 19:50:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:59,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-08 19:50:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:59,982 INFO L225 Difference]: With dead ends: 36440 [2018-12-08 19:50:59,982 INFO L226 Difference]: Without dead ends: 36440 [2018-12-08 19:50:59,982 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-08 19:51:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36440 states. [2018-12-08 19:51:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36440 to 34804. [2018-12-08 19:51:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34804 states. [2018-12-08 19:51:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34804 states to 34804 states and 108109 transitions. [2018-12-08 19:51:00,399 INFO L78 Accepts]: Start accepts. Automaton has 34804 states and 108109 transitions. Word has length 82 [2018-12-08 19:51:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:00,400 INFO L480 AbstractCegarLoop]: Abstraction has 34804 states and 108109 transitions. [2018-12-08 19:51:00,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:51:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34804 states and 108109 transitions. [2018-12-08 19:51:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 19:51:00,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:00,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:51:00,424 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:00,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash 70435287, now seen corresponding path program 1 times [2018-12-08 19:51:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:00,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:00,489 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-08 19:51:00,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:00,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:51:00,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:00,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:51:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:51:00,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:51:00,489 INFO L87 Difference]: Start difference. First operand 34804 states and 108109 transitions. Second operand 7 states. [2018-12-08 19:51:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:01,101 INFO L93 Difference]: Finished difference Result 61448 states and 189280 transitions. [2018-12-08 19:51:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 19:51:01,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-08 19:51:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:01,180 INFO L225 Difference]: With dead ends: 61448 [2018-12-08 19:51:01,180 INFO L226 Difference]: Without dead ends: 61112 [2018-12-08 19:51:01,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:51:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61112 states. [2018-12-08 19:51:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61112 to 36161. [2018-12-08 19:51:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36161 states. [2018-12-08 19:51:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36161 states to 36161 states and 112088 transitions. [2018-12-08 19:51:01,722 INFO L78 Accepts]: Start accepts. Automaton has 36161 states and 112088 transitions. Word has length 82 [2018-12-08 19:51:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:01,722 INFO L480 AbstractCegarLoop]: Abstraction has 36161 states and 112088 transitions. [2018-12-08 19:51:01,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:51:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 36161 states and 112088 transitions. [2018-12-08 19:51:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 19:51:01,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:01,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:51:01,749 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:01,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash -852248296, now seen corresponding path program 1 times [2018-12-08 19:51:01,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:01,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:01,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:01,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:01,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:01,813 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-08 19:51:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:51:01,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:01,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:51:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:51:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:51:01,814 INFO L87 Difference]: Start difference. First operand 36161 states and 112088 transitions. Second operand 8 states. [2018-12-08 19:51:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:03,946 INFO L93 Difference]: Finished difference Result 53145 states and 161315 transitions. [2018-12-08 19:51:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 19:51:03,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-08 19:51:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:04,021 INFO L225 Difference]: With dead ends: 53145 [2018-12-08 19:51:04,021 INFO L226 Difference]: Without dead ends: 53145 [2018-12-08 19:51:04,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-08 19:51:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53145 states. [2018-12-08 19:51:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53145 to 35117. [2018-12-08 19:51:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35117 states. [2018-12-08 19:51:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35117 states to 35117 states and 108430 transitions. [2018-12-08 19:51:04,536 INFO L78 Accepts]: Start accepts. Automaton has 35117 states and 108430 transitions. Word has length 82 [2018-12-08 19:51:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:04,536 INFO L480 AbstractCegarLoop]: Abstraction has 35117 states and 108430 transitions. [2018-12-08 19:51:04,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:51:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 35117 states and 108430 transitions. [2018-12-08 19:51:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 19:51:04,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:04,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:51:04,561 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:04,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash 873232601, now seen corresponding path program 1 times [2018-12-08 19:51:04,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:04,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:04,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:04,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:04,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:04,598 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-08 19:51:04,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:04,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:51:04,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:04,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:51:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:51:04,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:51:04,599 INFO L87 Difference]: Start difference. First operand 35117 states and 108430 transitions. Second operand 5 states. [2018-12-08 19:51:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:04,620 INFO L93 Difference]: Finished difference Result 4641 states and 11865 transitions. [2018-12-08 19:51:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:51:04,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-08 19:51:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:04,623 INFO L225 Difference]: With dead ends: 4641 [2018-12-08 19:51:04,623 INFO L226 Difference]: Without dead ends: 4025 [2018-12-08 19:51:04,623 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-08 19:51:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-12-08 19:51:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3903. [2018-12-08 19:51:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3903 states. [2018-12-08 19:51:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 9981 transitions. [2018-12-08 19:51:04,649 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 9981 transitions. Word has length 82 [2018-12-08 19:51:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:04,649 INFO L480 AbstractCegarLoop]: Abstraction has 3903 states and 9981 transitions. [2018-12-08 19:51:04,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:51:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 9981 transitions. [2018-12-08 19:51:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:04,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:04,651 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-08 19:51:04,651 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:04,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash -977364778, now seen corresponding path program 1 times [2018-12-08 19:51:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:04,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:04,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:04,713 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-08 19:51:04,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:04,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:51:04,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:04,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:51:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:51:04,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:51:04,714 INFO L87 Difference]: Start difference. First operand 3903 states and 9981 transitions. Second operand 8 states. [2018-12-08 19:51:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:05,077 INFO L93 Difference]: Finished difference Result 6980 states and 17751 transitions. [2018-12-08 19:51:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 19:51:05,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-08 19:51:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:05,083 INFO L225 Difference]: With dead ends: 6980 [2018-12-08 19:51:05,083 INFO L226 Difference]: Without dead ends: 6948 [2018-12-08 19:51:05,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 19:51:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2018-12-08 19:51:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 4115. [2018-12-08 19:51:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4115 states. [2018-12-08 19:51:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 10495 transitions. [2018-12-08 19:51:05,133 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 10495 transitions. Word has length 94 [2018-12-08 19:51:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 4115 states and 10495 transitions. [2018-12-08 19:51:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:51:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 10495 transitions. [2018-12-08 19:51:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:05,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:05,136 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-08 19:51:05,137 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:05,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -15750761, now seen corresponding path program 1 times [2018-12-08 19:51:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:05,180 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-08 19:51:05,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:05,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:51:05,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:05,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:51:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:51:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:51:05,181 INFO L87 Difference]: Start difference. First operand 4115 states and 10495 transitions. Second operand 5 states. [2018-12-08 19:51:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:05,313 INFO L93 Difference]: Finished difference Result 4847 states and 12188 transitions. [2018-12-08 19:51:05,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:51:05,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 19:51:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:05,317 INFO L225 Difference]: With dead ends: 4847 [2018-12-08 19:51:05,317 INFO L226 Difference]: Without dead ends: 4847 [2018-12-08 19:51:05,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:51:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-12-08 19:51:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4271. [2018-12-08 19:51:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-12-08 19:51:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10831 transitions. [2018-12-08 19:51:05,358 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10831 transitions. Word has length 94 [2018-12-08 19:51:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:05,358 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10831 transitions. [2018-12-08 19:51:05,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:51:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10831 transitions. [2018-12-08 19:51:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:05,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:05,362 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-08 19:51:05,362 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:05,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1153917381, now seen corresponding path program 1 times [2018-12-08 19:51:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:05,417 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-08 19:51:05,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:05,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:51:05,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:05,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:51:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:51:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:51:05,418 INFO L87 Difference]: Start difference. First operand 4271 states and 10831 transitions. Second operand 6 states. [2018-12-08 19:51:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:05,587 INFO L93 Difference]: Finished difference Result 4582 states and 11436 transitions. [2018-12-08 19:51:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:51:05,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 19:51:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:05,591 INFO L225 Difference]: With dead ends: 4582 [2018-12-08 19:51:05,591 INFO L226 Difference]: Without dead ends: 4545 [2018-12-08 19:51:05,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:51:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2018-12-08 19:51:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4457. [2018-12-08 19:51:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4457 states. [2018-12-08 19:51:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 11198 transitions. [2018-12-08 19:51:05,623 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 11198 transitions. Word has length 94 [2018-12-08 19:51:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:05,623 INFO L480 AbstractCegarLoop]: Abstraction has 4457 states and 11198 transitions. [2018-12-08 19:51:05,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:51:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 11198 transitions. [2018-12-08 19:51:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:05,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:05,626 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-08 19:51:05,626 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:05,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1440309436, now seen corresponding path program 1 times [2018-12-08 19:51:05,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:51:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:05,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:51:05,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:05,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:51:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:51:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:51:05,684 INFO L87 Difference]: Start difference. First operand 4457 states and 11198 transitions. Second operand 7 states. [2018-12-08 19:51:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:05,863 INFO L93 Difference]: Finished difference Result 4757 states and 11937 transitions. [2018-12-08 19:51:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:51:05,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-08 19:51:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:05,868 INFO L225 Difference]: With dead ends: 4757 [2018-12-08 19:51:05,868 INFO L226 Difference]: Without dead ends: 4757 [2018-12-08 19:51:05,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:51:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2018-12-08 19:51:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4431. [2018-12-08 19:51:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4431 states. [2018-12-08 19:51:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 11153 transitions. [2018-12-08 19:51:05,910 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 11153 transitions. Word has length 94 [2018-12-08 19:51:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:05,910 INFO L480 AbstractCegarLoop]: Abstraction has 4431 states and 11153 transitions. [2018-12-08 19:51:05,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:51:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 11153 transitions. [2018-12-08 19:51:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:05,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:05,914 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-08 19:51:05,914 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:05,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash -29429916, now seen corresponding path program 1 times [2018-12-08 19:51:05,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:05,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:05,983 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-08 19:51:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:51:05,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:05,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:51:05,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:51:05,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:51:05,984 INFO L87 Difference]: Start difference. First operand 4431 states and 11153 transitions. Second operand 5 states. [2018-12-08 19:51:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:06,066 INFO L93 Difference]: Finished difference Result 4142 states and 10429 transitions. [2018-12-08 19:51:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:51:06,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 19:51:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:06,070 INFO L225 Difference]: With dead ends: 4142 [2018-12-08 19:51:06,070 INFO L226 Difference]: Without dead ends: 4142 [2018-12-08 19:51:06,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:51:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2018-12-08 19:51:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4062. [2018-12-08 19:51:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2018-12-08 19:51:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 10264 transitions. [2018-12-08 19:51:06,107 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 10264 transitions. Word has length 94 [2018-12-08 19:51:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:06,107 INFO L480 AbstractCegarLoop]: Abstraction has 4062 states and 10264 transitions. [2018-12-08 19:51:06,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:51:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 10264 transitions. [2018-12-08 19:51:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:06,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:06,110 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-08 19:51:06,111 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:06,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2076165861, now seen corresponding path program 1 times [2018-12-08 19:51:06,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:06,161 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-08 19:51:06,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:06,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:51:06,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:06,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:51:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:51:06,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:51:06,162 INFO L87 Difference]: Start difference. First operand 4062 states and 10264 transitions. Second operand 5 states. [2018-12-08 19:51:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:06,262 INFO L93 Difference]: Finished difference Result 8009 states and 20474 transitions. [2018-12-08 19:51:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:51:06,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 19:51:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:06,267 INFO L225 Difference]: With dead ends: 8009 [2018-12-08 19:51:06,267 INFO L226 Difference]: Without dead ends: 8009 [2018-12-08 19:51:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:51:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8009 states. [2018-12-08 19:51:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8009 to 4108. [2018-12-08 19:51:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2018-12-08 19:51:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10355 transitions. [2018-12-08 19:51:06,308 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10355 transitions. Word has length 94 [2018-12-08 19:51:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:06,308 INFO L480 AbstractCegarLoop]: Abstraction has 4108 states and 10355 transitions. [2018-12-08 19:51:06,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:51:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10355 transitions. [2018-12-08 19:51:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 19:51:06,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:06,311 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-08 19:51:06,311 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:06,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:06,311 INFO L82 PathProgramCache]: Analyzing trace with hash -140505574, now seen corresponding path program 1 times [2018-12-08 19:51:06,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:06,384 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-08 19:51:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:06,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:51:06,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:06,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:51:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:51:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:51:06,385 INFO L87 Difference]: Start difference. First operand 4108 states and 10355 transitions. Second operand 6 states. [2018-12-08 19:51:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:06,457 INFO L93 Difference]: Finished difference Result 3868 states and 9563 transitions. [2018-12-08 19:51:06,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:51:06,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 19:51:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:06,460 INFO L225 Difference]: With dead ends: 3868 [2018-12-08 19:51:06,460 INFO L226 Difference]: Without dead ends: 3868 [2018-12-08 19:51:06,460 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-08 19:51:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2018-12-08 19:51:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3305. [2018-12-08 19:51:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-12-08 19:51:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 8242 transitions. [2018-12-08 19:51:06,484 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 8242 transitions. Word has length 94 [2018-12-08 19:51:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:06,484 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 8242 transitions. [2018-12-08 19:51:06,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:51:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 8242 transitions. [2018-12-08 19:51:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 19:51:06,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:06,486 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-08 19:51:06,487 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:06,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-08 19:51:06,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:06,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:06,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:06,536 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-08 19:51:06,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:06,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:51:06,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:06,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:51:06,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:51:06,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:51:06,537 INFO L87 Difference]: Start difference. First operand 3305 states and 8242 transitions. Second operand 7 states. [2018-12-08 19:51:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:06,671 INFO L93 Difference]: Finished difference Result 3314 states and 8245 transitions. [2018-12-08 19:51:06,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:51:06,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-08 19:51:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:06,674 INFO L225 Difference]: With dead ends: 3314 [2018-12-08 19:51:06,674 INFO L226 Difference]: Without dead ends: 3314 [2018-12-08 19:51:06,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:51:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-12-08 19:51:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3270. [2018-12-08 19:51:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-08 19:51:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 8161 transitions. [2018-12-08 19:51:06,695 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 8161 transitions. Word has length 96 [2018-12-08 19:51:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:06,695 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 8161 transitions. [2018-12-08 19:51:06,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:51:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 8161 transitions. [2018-12-08 19:51:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 19:51:06,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:06,697 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-08 19:51:06,697 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:06,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-08 19:51:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:06,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-08 19:51:06,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:06,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:51:06,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:06,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:51:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:51:06,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:51:06,752 INFO L87 Difference]: Start difference. First operand 3270 states and 8161 transitions. Second operand 5 states. [2018-12-08 19:51:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:06,843 INFO L93 Difference]: Finished difference Result 3718 states and 9265 transitions. [2018-12-08 19:51:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:51:06,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-08 19:51:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:06,846 INFO L225 Difference]: With dead ends: 3718 [2018-12-08 19:51:06,846 INFO L226 Difference]: Without dead ends: 3686 [2018-12-08 19:51:06,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:51:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-12-08 19:51:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3086. [2018-12-08 19:51:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3086 states. [2018-12-08 19:51:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 7702 transitions. [2018-12-08 19:51:06,868 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 7702 transitions. Word has length 96 [2018-12-08 19:51:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:06,868 INFO L480 AbstractCegarLoop]: Abstraction has 3086 states and 7702 transitions. [2018-12-08 19:51:06,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:51:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 7702 transitions. [2018-12-08 19:51:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 19:51:06,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:06,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:51:06,870 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:06,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-08 19:51:06,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:06,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:06,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:06,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:06,961 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-08 19:51:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:06,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 19:51:06,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:06,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 19:51:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:51:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:51:06,962 INFO L87 Difference]: Start difference. First operand 3086 states and 7702 transitions. Second operand 10 states. [2018-12-08 19:51:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:07,236 INFO L93 Difference]: Finished difference Result 5201 states and 13167 transitions. [2018-12-08 19:51:07,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:51:07,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-08 19:51:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:07,238 INFO L225 Difference]: With dead ends: 5201 [2018-12-08 19:51:07,238 INFO L226 Difference]: Without dead ends: 2091 [2018-12-08 19:51:07,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-08 19:51:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-08 19:51:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2091. [2018-12-08 19:51:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2018-12-08 19:51:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 5397 transitions. [2018-12-08 19:51:07,251 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 5397 transitions. Word has length 96 [2018-12-08 19:51:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:07,251 INFO L480 AbstractCegarLoop]: Abstraction has 2091 states and 5397 transitions. [2018-12-08 19:51:07,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 19:51:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 5397 transitions. [2018-12-08 19:51:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 19:51:07,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:07,252 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-08 19:51:07,253 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:07,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:07,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-08 19:51:07,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:07,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:07,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:51:07,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:07,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:07,295 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-08 19:51:07,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:07,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:51:07,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:07,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:51:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:51:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:51:07,296 INFO L87 Difference]: Start difference. First operand 2091 states and 5397 transitions. Second operand 5 states. [2018-12-08 19:51:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:07,318 INFO L93 Difference]: Finished difference Result 2091 states and 5387 transitions. [2018-12-08 19:51:07,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:51:07,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-08 19:51:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:07,320 INFO L225 Difference]: With dead ends: 2091 [2018-12-08 19:51:07,320 INFO L226 Difference]: Without dead ends: 2091 [2018-12-08 19:51:07,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:51:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-08 19:51:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2051. [2018-12-08 19:51:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-08 19:51:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-08 19:51:07,334 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-08 19:51:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:07,334 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-08 19:51:07,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:51:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-08 19:51:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 19:51:07,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:07,335 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-08 19:51:07,335 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:07,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-08 19:51:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:07,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:51:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:07,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:07,450 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-08 19:51:07,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:51:07,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 19:51:07,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:51:07,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 19:51:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 19:51:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:51:07,451 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-08 19:51:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:51:07,814 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-08 19:51:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 19:51:07,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-08 19:51:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:51:07,817 INFO L225 Difference]: With dead ends: 3882 [2018-12-08 19:51:07,817 INFO L226 Difference]: Without dead ends: 2746 [2018-12-08 19:51:07,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-08 19:51:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-08 19:51:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-08 19:51:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-08 19:51:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-08 19:51:07,834 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-08 19:51:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:51:07,834 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-08 19:51:07,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 19:51:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-08 19:51:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 19:51:07,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:51:07,836 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-08 19:51:07,836 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:51:07,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-08 19:51:07,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:51:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:07,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:51:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:51:07,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:51:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:51:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:51:07,875 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:51:07,954 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 19:51:07,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:51:07 BasicIcfg [2018-12-08 19:51:07,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:51:07,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:51:07,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:51:07,956 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:51:07,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:50:44" (3/4) ... [2018-12-08 19:51:07,958 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:51:08,046 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a13f9e5a-9bb2-4c19-bd50-c00a4a7cd6b0/bin-2019/utaipan/witness.graphml [2018-12-08 19:51:08,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:51:08,047 INFO L168 Benchmark]: Toolchain (without parser) took 24644.61 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 950.6 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,047 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:51:08,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.02 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,048 INFO L168 Benchmark]: Boogie Preprocessor took 19.33 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,048 INFO L168 Benchmark]: RCFGBuilder took 338.27 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.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,048 INFO L168 Benchmark]: TraceAbstraction took 23850.92 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,048 INFO L168 Benchmark]: Witness Printer took 90.16 ms. Allocated memory is still 3.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2018-12-08 19:51:08,049 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.02 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.33 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 338.27 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.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23850.92 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 90.16 ms. Allocated memory is still 3.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1105; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1106; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 23.7s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8885 SDtfs, 9507 SDslu, 21341 SDs, 0 SdLazy, 10048 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 96 SyntacticMatches, 22 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, 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: 8.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 171160 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2547 NumberOfCodeBlocks, 2547 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2419 ConstructedInterpolants, 0 QuantifiedInterpolants, 490648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...