./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/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 27339ad9b830c0fc741c5fcfcfdd664d6e21868b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 16:52:18,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:52:18,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:52:18,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:52:18,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:52:18,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:52:18,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:52:18,762 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:52:18,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:52:18,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:52:18,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:52:18,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:52:18,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:52:18,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:52:18,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:52:18,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:52:18,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:52:18,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:52:18,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:52:18,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:52:18,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:52:18,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:52:18,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:52:18,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:52:18,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:52:18,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:52:18,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:52:18,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:52:18,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:52:18,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:52:18,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:52:18,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:52:18,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:52:18,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:52:18,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:52:18,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:52:18,776 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 16:52:18,783 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:52:18,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:52:18,784 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:52:18,784 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:52:18,784 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 16:52:18,784 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 16:52:18,785 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 16:52:18,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:52:18,786 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:52:18,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:52:18,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:52:18,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:52:18,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 16:52:18,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 16:52:18,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:52:18,787 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:52:18,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 16:52:18,788 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 16:52:18,789 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_0ac73f78-4481-478b-8c32-67e0d02a4938/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 -> 27339ad9b830c0fc741c5fcfcfdd664d6e21868b [2018-12-08 16:52:18,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:52:18,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:52:18,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:52:18,819 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:52:18,820 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:52:18,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc_false-unreach-call.i [2018-12-08 16:52:18,864 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/data/ddc0e1093/8759efaf8d914a0cb99c40c3e9e25356/FLAGc0415aefd [2018-12-08 16:52:19,277 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:52:19,277 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc_false-unreach-call.i [2018-12-08 16:52:19,284 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/data/ddc0e1093/8759efaf8d914a0cb99c40c3e9e25356/FLAGc0415aefd [2018-12-08 16:52:19,293 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/data/ddc0e1093/8759efaf8d914a0cb99c40c3e9e25356 [2018-12-08 16:52:19,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:52:19,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:52:19,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:52:19,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:52:19,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:52:19,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19, skipping insertion in model container [2018-12-08 16:52:19,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:52:19,326 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:52:19,512 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:52:19,519 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:52:19,591 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:52:19,622 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:52:19,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19 WrapperNode [2018-12-08 16:52:19,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:52:19,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:52:19,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:52:19,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:52:19,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:52:19,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:52:19,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:52:19,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:52:19,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... [2018-12-08 16:52:19,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:52:19,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:52:19,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:52:19,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:52:19,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/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 16:52:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:52:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:52:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 16:52:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:52:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 16:52:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 16:52:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 16:52:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 16:52:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 16:52:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:52:19,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:52:19,719 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 16:52:20,028 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:52:20,029 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 16:52:20,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:52:20 BoogieIcfgContainer [2018-12-08 16:52:20,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:52:20,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:52:20,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:52:20,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:52:20,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:52:19" (1/3) ... [2018-12-08 16:52:20,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574d2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:52:20, skipping insertion in model container [2018-12-08 16:52:20,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:52:19" (2/3) ... [2018-12-08 16:52:20,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574d2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:52:20, skipping insertion in model container [2018-12-08 16:52:20,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:52:20" (3/3) ... [2018-12-08 16:52:20,033 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc_false-unreach-call.i [2018-12-08 16:52:20,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,061 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:52:20,075 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 16:52:20,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:52:20,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 16:52:20,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 16:52:20,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:52:20,104 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 16:52:20,104 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:52:20,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:52:20,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:52:20,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:52:20,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:52:20,105 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:52:20,111 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-08 16:52:21,530 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-08 16:52:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-08 16:52:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 16:52:21,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:21,536 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] [2018-12-08 16:52:21,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2018-12-08 16:52:21,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:21,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:21,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:21,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:21,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:21,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:21,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:21,683 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-08 16:52:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:22,106 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-08 16:52:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:52:22,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-08 16:52:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:22,255 INFO L225 Difference]: With dead ends: 60790 [2018-12-08 16:52:22,255 INFO L226 Difference]: Without dead ends: 44270 [2018-12-08 16:52:22,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-08 16:52:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-08 16:52:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-08 16:52:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-08 16:52:22,977 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-08 16:52:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:22,977 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-08 16:52:22,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-08 16:52:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 16:52:22,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:22,982 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 16:52:22,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:22,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2018-12-08 16:52:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:22,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:22,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:22,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:22,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:23,031 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 16:52:23,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:23,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:23,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:23,033 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-08 16:52:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:23,144 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-08 16:52:23,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:52:23,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-08 16:52:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:23,165 INFO L225 Difference]: With dead ends: 8528 [2018-12-08 16:52:23,166 INFO L226 Difference]: Without dead ends: 7466 [2018-12-08 16:52:23,166 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 16:52:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-08 16:52:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-08 16:52:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-08 16:52:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-08 16:52:23,263 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-08 16:52:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:23,264 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-08 16:52:23,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-08 16:52:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 16:52:23,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:23,265 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 16:52:23,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:23,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2018-12-08 16:52:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:23,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:23,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:23,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:23,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:23,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:23,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:23,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:23,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:23,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:23,321 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-08 16:52:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:23,533 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-08 16:52:23,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:23,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 16:52:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:23,559 INFO L225 Difference]: With dead ends: 13998 [2018-12-08 16:52:23,560 INFO L226 Difference]: Without dead ends: 13930 [2018-12-08 16:52:23,560 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 16:52:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-08 16:52:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-08 16:52:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-08 16:52:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-08 16:52:23,747 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-08 16:52:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:23,748 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-08 16:52:23,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-08 16:52:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 16:52:23,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:23,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] [2018-12-08 16:52:23,750 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:23,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2018-12-08 16:52:23,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:23,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:23,779 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 16:52:23,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:23,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:52:23,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:23,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:52:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:52:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:52:23,781 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-08 16:52:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:23,839 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-08 16:52:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:52:23,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-08 16:52:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:23,855 INFO L225 Difference]: With dead ends: 13279 [2018-12-08 16:52:23,855 INFO L226 Difference]: Without dead ends: 13279 [2018-12-08 16:52:23,855 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 16:52:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-08 16:52:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-08 16:52:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-08 16:52:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-08 16:52:23,981 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-08 16:52:23,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:23,981 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-08 16:52:23,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:52:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-08 16:52:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 16:52:23,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:23,983 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] [2018-12-08 16:52:23,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:23,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2018-12-08 16:52:23,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:23,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:23,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:23,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:24,056 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 16:52:24,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:24,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:52:24,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:24,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:52:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:52:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:52:24,057 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-08 16:52:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:24,446 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-08 16:52:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:52:24,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-08 16:52:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:24,461 INFO L225 Difference]: With dead ends: 12285 [2018-12-08 16:52:24,461 INFO L226 Difference]: Without dead ends: 12213 [2018-12-08 16:52:24,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-08 16:52:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-08 16:52:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-08 16:52:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-08 16:52:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-08 16:52:24,575 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-08 16:52:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:24,576 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-08 16:52:24,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:52:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-08 16:52:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 16:52:24,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:24,579 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] [2018-12-08 16:52:24,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:24,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2018-12-08 16:52:24,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:24,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:24,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:24,674 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 16:52:24,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:24,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:24,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:24,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:24,675 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-08 16:52:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:24,747 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-08 16:52:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:52:24,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-08 16:52:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:24,761 INFO L225 Difference]: With dead ends: 12396 [2018-12-08 16:52:24,761 INFO L226 Difference]: Without dead ends: 12396 [2018-12-08 16:52:24,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-08 16:52:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-08 16:52:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-08 16:52:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-08 16:52:24,884 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-08 16:52:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:24,884 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-08 16:52:24,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-08 16:52:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 16:52:24,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:24,887 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] [2018-12-08 16:52:24,887 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:24,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2018-12-08 16:52:24,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:24,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:24,941 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 16:52:24,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:24,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:52:24,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:24,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:52:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:52:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:52:24,941 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-08 16:52:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:25,218 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-08 16:52:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 16:52:25,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-08 16:52:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:25,241 INFO L225 Difference]: With dead ends: 20969 [2018-12-08 16:52:25,241 INFO L226 Difference]: Without dead ends: 20898 [2018-12-08 16:52:25,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:52:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-08 16:52:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-08 16:52:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-08 16:52:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-08 16:52:25,423 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-08 16:52:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:25,423 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-08 16:52:25,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:52:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-08 16:52:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:52:25,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:25,427 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] [2018-12-08 16:52:25,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:25,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1407589042, now seen corresponding path program 1 times [2018-12-08 16:52:25,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:25,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:25,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:25,491 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 16:52:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:25,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:25,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:25,492 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-08 16:52:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:25,762 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-08 16:52:25,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:52:25,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 16:52:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:25,790 INFO L225 Difference]: With dead ends: 23352 [2018-12-08 16:52:25,790 INFO L226 Difference]: Without dead ends: 23352 [2018-12-08 16:52:25,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-08 16:52:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-08 16:52:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-08 16:52:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-08 16:52:25,998 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-08 16:52:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:25,998 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-08 16:52:25,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-08 16:52:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:52:26,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:26,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:52:26,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:26,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1114186035, now seen corresponding path program 1 times [2018-12-08 16:52:26,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:26,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:26,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:26,057 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 16:52:26,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:26,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:26,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:26,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:26,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:26,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:26,058 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-08 16:52:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:26,278 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-08 16:52:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:52:26,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 16:52:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:26,298 INFO L225 Difference]: With dead ends: 18411 [2018-12-08 16:52:26,298 INFO L226 Difference]: Without dead ends: 18411 [2018-12-08 16:52:26,298 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 16:52:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-08 16:52:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-08 16:52:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-08 16:52:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-08 16:52:26,476 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-08 16:52:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:26,476 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-08 16:52:26,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-08 16:52:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:52:26,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:26,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:52:26,481 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:26,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash -152572018, now seen corresponding path program 1 times [2018-12-08 16:52:26,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:26,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:26,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:26,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:26,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:26,503 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 16:52:26,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:26,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:52:26,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:52:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:52:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:52:26,504 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-08 16:52:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:26,654 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-08 16:52:26,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:52:26,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-08 16:52:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:26,673 INFO L225 Difference]: With dead ends: 17193 [2018-12-08 16:52:26,673 INFO L226 Difference]: Without dead ends: 17193 [2018-12-08 16:52:26,673 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 16:52:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-08 16:52:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-08 16:52:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-08 16:52:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-08 16:52:26,843 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-08 16:52:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:26,843 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-08 16:52:26,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:52:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-08 16:52:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:52:26,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:26,849 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] [2018-12-08 16:52:26,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:26,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash -776511433, now seen corresponding path program 1 times [2018-12-08 16:52:26,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:26,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:26,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:26,908 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 16:52:26,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:52:26,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:26,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:52:26,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:52:26,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:52:26,909 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-08 16:52:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:27,623 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-08 16:52:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:27,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 16:52:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:27,647 INFO L225 Difference]: With dead ends: 20789 [2018-12-08 16:52:27,647 INFO L226 Difference]: Without dead ends: 20789 [2018-12-08 16:52:27,648 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 16:52:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-08 16:52:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-08 16:52:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-08 16:52:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-08 16:52:27,868 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-08 16:52:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:27,868 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-08 16:52:27,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:52:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-08 16:52:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:52:27,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:27,875 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] [2018-12-08 16:52:27,875 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:27,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash 185102584, now seen corresponding path program 1 times [2018-12-08 16:52:27,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:27,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:27,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:27,945 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 16:52:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:52:27,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:27,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:52:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:52:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:52:27,946 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-08 16:52:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:28,203 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-08 16:52:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:52:28,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 16:52:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:28,225 INFO L225 Difference]: With dead ends: 22441 [2018-12-08 16:52:28,225 INFO L226 Difference]: Without dead ends: 22441 [2018-12-08 16:52:28,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:52:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-08 16:52:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-08 16:52:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-08 16:52:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-08 16:52:28,423 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-08 16:52:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:28,423 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-08 16:52:28,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:52:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-08 16:52:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:52:28,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:28,430 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] [2018-12-08 16:52:28,430 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:28,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1429867065, now seen corresponding path program 1 times [2018-12-08 16:52:28,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:28,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:28,496 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 16:52:28,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:28,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:28,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:28,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:28,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:28,497 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-08 16:52:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:28,718 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-08 16:52:28,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:28,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-08 16:52:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:28,748 INFO L225 Difference]: With dead ends: 26432 [2018-12-08 16:52:28,748 INFO L226 Difference]: Without dead ends: 26432 [2018-12-08 16:52:28,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:52:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-08 16:52:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-08 16:52:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-08 16:52:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-08 16:52:29,000 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-08 16:52:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:29,001 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-08 16:52:29,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-08 16:52:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:52:29,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:29,009 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] [2018-12-08 16:52:29,009 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:29,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 919332888, now seen corresponding path program 1 times [2018-12-08 16:52:29,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:29,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:29,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:29,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:29,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:29,054 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 16:52:29,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:29,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:29,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:29,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:29,055 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-08 16:52:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:29,389 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-08 16:52:29,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:52:29,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-08 16:52:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:29,426 INFO L225 Difference]: With dead ends: 33063 [2018-12-08 16:52:29,426 INFO L226 Difference]: Without dead ends: 33063 [2018-12-08 16:52:29,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:52:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-08 16:52:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-08 16:52:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-08 16:52:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-08 16:52:29,781 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-08 16:52:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:29,781 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-08 16:52:29,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-08 16:52:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:52:29,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:29,790 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] [2018-12-08 16:52:29,790 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:29,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -888121575, now seen corresponding path program 1 times [2018-12-08 16:52:29,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:29,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:29,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:29,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:29,830 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 16:52:29,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:29,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:29,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:29,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:29,831 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 5 states. [2018-12-08 16:52:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:29,871 INFO L93 Difference]: Finished difference Result 9075 states and 21914 transitions. [2018-12-08 16:52:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:52:29,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-08 16:52:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:29,877 INFO L225 Difference]: With dead ends: 9075 [2018-12-08 16:52:29,877 INFO L226 Difference]: Without dead ends: 7223 [2018-12-08 16:52:29,877 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 16:52:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7223 states. [2018-12-08 16:52:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7223 to 6120. [2018-12-08 16:52:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2018-12-08 16:52:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 14385 transitions. [2018-12-08 16:52:29,927 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 14385 transitions. Word has length 66 [2018-12-08 16:52:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:29,927 INFO L480 AbstractCegarLoop]: Abstraction has 6120 states and 14385 transitions. [2018-12-08 16:52:29,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 14385 transitions. [2018-12-08 16:52:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:52:29,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:29,931 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] [2018-12-08 16:52:29,931 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:29,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2018-12-08 16:52:29,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:29,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:29,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:29,947 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 16:52:29,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:29,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:52:29,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:29,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:52:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:52:29,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:52:29,948 INFO L87 Difference]: Start difference. First operand 6120 states and 14385 transitions. Second operand 3 states. [2018-12-08 16:52:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:29,973 INFO L93 Difference]: Finished difference Result 8339 states and 19492 transitions. [2018-12-08 16:52:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:52:29,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-08 16:52:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:29,979 INFO L225 Difference]: With dead ends: 8339 [2018-12-08 16:52:29,979 INFO L226 Difference]: Without dead ends: 8339 [2018-12-08 16:52:29,979 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 16:52:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8339 states. [2018-12-08 16:52:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8339 to 6059. [2018-12-08 16:52:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6059 states. [2018-12-08 16:52:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 13925 transitions. [2018-12-08 16:52:30,025 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 13925 transitions. Word has length 66 [2018-12-08 16:52:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:30,026 INFO L480 AbstractCegarLoop]: Abstraction has 6059 states and 13925 transitions. [2018-12-08 16:52:30,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:52:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 13925 transitions. [2018-12-08 16:52:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 16:52:30,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:30,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:52:30,030 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:30,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2018-12-08 16:52:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:30,063 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 16:52:30,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:30,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:30,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:30,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:30,064 INFO L87 Difference]: Start difference. First operand 6059 states and 13925 transitions. Second operand 5 states. [2018-12-08 16:52:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:30,156 INFO L93 Difference]: Finished difference Result 7229 states and 16566 transitions. [2018-12-08 16:52:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:52:30,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-08 16:52:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:30,160 INFO L225 Difference]: With dead ends: 7229 [2018-12-08 16:52:30,160 INFO L226 Difference]: Without dead ends: 7229 [2018-12-08 16:52:30,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:52:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2018-12-08 16:52:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6503. [2018-12-08 16:52:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2018-12-08 16:52:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 14929 transitions. [2018-12-08 16:52:30,206 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 14929 transitions. Word has length 72 [2018-12-08 16:52:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 6503 states and 14929 transitions. [2018-12-08 16:52:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 14929 transitions. [2018-12-08 16:52:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 16:52:30,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:30,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:52:30,211 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:30,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2018-12-08 16:52:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:30,309 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 16:52:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:30,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:52:30,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:30,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:52:30,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:52:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:52:30,310 INFO L87 Difference]: Start difference. First operand 6503 states and 14929 transitions. Second operand 9 states. [2018-12-08 16:52:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:30,605 INFO L93 Difference]: Finished difference Result 8529 states and 19410 transitions. [2018-12-08 16:52:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 16:52:30,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-08 16:52:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:30,611 INFO L225 Difference]: With dead ends: 8529 [2018-12-08 16:52:30,611 INFO L226 Difference]: Without dead ends: 8410 [2018-12-08 16:52:30,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-08 16:52:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-12-08 16:52:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 6600. [2018-12-08 16:52:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6600 states. [2018-12-08 16:52:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 15022 transitions. [2018-12-08 16:52:30,664 INFO L78 Accepts]: Start accepts. Automaton has 6600 states and 15022 transitions. Word has length 72 [2018-12-08 16:52:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:30,664 INFO L480 AbstractCegarLoop]: Abstraction has 6600 states and 15022 transitions. [2018-12-08 16:52:30,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:52:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 15022 transitions. [2018-12-08 16:52:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 16:52:30,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:30,669 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] [2018-12-08 16:52:30,669 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:30,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:30,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1375926790, now seen corresponding path program 1 times [2018-12-08 16:52:30,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:30,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:30,708 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 16:52:30,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:30,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:30,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:30,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:30,709 INFO L87 Difference]: Start difference. First operand 6600 states and 15022 transitions. Second operand 4 states. [2018-12-08 16:52:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:30,872 INFO L93 Difference]: Finished difference Result 10287 states and 23293 transitions. [2018-12-08 16:52:30,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:52:30,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 16:52:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:30,878 INFO L225 Difference]: With dead ends: 10287 [2018-12-08 16:52:30,878 INFO L226 Difference]: Without dead ends: 10287 [2018-12-08 16:52:30,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2018-12-08 16:52:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 7720. [2018-12-08 16:52:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7720 states. [2018-12-08 16:52:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 17356 transitions. [2018-12-08 16:52:30,939 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 17356 transitions. Word has length 91 [2018-12-08 16:52:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:30,940 INFO L480 AbstractCegarLoop]: Abstraction has 7720 states and 17356 transitions. [2018-12-08 16:52:30,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 17356 transitions. [2018-12-08 16:52:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 16:52:30,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:30,945 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] [2018-12-08 16:52:30,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:30,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 533882140, now seen corresponding path program 1 times [2018-12-08 16:52:30,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:30,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:30,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:30,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:52:30,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:52:30,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:52:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:52:30,996 INFO L87 Difference]: Start difference. First operand 7720 states and 17356 transitions. Second operand 4 states. [2018-12-08 16:52:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:31,062 INFO L93 Difference]: Finished difference Result 8285 states and 18649 transitions. [2018-12-08 16:52:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:52:31,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 16:52:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:31,067 INFO L225 Difference]: With dead ends: 8285 [2018-12-08 16:52:31,067 INFO L226 Difference]: Without dead ends: 8285 [2018-12-08 16:52:31,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2018-12-08 16:52:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 7626. [2018-12-08 16:52:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2018-12-08 16:52:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 17251 transitions. [2018-12-08 16:52:31,121 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 17251 transitions. Word has length 91 [2018-12-08 16:52:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:31,122 INFO L480 AbstractCegarLoop]: Abstraction has 7626 states and 17251 transitions. [2018-12-08 16:52:31,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:52:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 17251 transitions. [2018-12-08 16:52:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:31,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:31,127 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] [2018-12-08 16:52:31,127 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:31,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1680047616, now seen corresponding path program 1 times [2018-12-08 16:52:31,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:31,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:31,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:31,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:31,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:31,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:31,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:52:31,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:31,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:52:31,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:52:31,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:52:31,202 INFO L87 Difference]: Start difference. First operand 7626 states and 17251 transitions. Second operand 7 states. [2018-12-08 16:52:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:31,698 INFO L93 Difference]: Finished difference Result 9400 states and 21199 transitions. [2018-12-08 16:52:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:31,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-08 16:52:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:31,704 INFO L225 Difference]: With dead ends: 9400 [2018-12-08 16:52:31,704 INFO L226 Difference]: Without dead ends: 9400 [2018-12-08 16:52:31,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 16:52:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2018-12-08 16:52:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 7738. [2018-12-08 16:52:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7738 states. [2018-12-08 16:52:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 17571 transitions. [2018-12-08 16:52:31,764 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 17571 transitions. Word has length 93 [2018-12-08 16:52:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:31,764 INFO L480 AbstractCegarLoop]: Abstraction has 7738 states and 17571 transitions. [2018-12-08 16:52:31,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:52:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 17571 transitions. [2018-12-08 16:52:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:31,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:31,769 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] [2018-12-08 16:52:31,769 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:31,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1241251611, now seen corresponding path program 1 times [2018-12-08 16:52:31,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:31,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:31,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:31,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:31,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:31,808 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 16:52:31,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:31,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:31,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:31,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:31,809 INFO L87 Difference]: Start difference. First operand 7738 states and 17571 transitions. Second operand 5 states. [2018-12-08 16:52:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:31,879 INFO L93 Difference]: Finished difference Result 8645 states and 19529 transitions. [2018-12-08 16:52:31,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:31,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-08 16:52:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:31,885 INFO L225 Difference]: With dead ends: 8645 [2018-12-08 16:52:31,885 INFO L226 Difference]: Without dead ends: 8645 [2018-12-08 16:52:31,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 16:52:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2018-12-08 16:52:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 6634. [2018-12-08 16:52:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6634 states. [2018-12-08 16:52:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 15090 transitions. [2018-12-08 16:52:31,939 INFO L78 Accepts]: Start accepts. Automaton has 6634 states and 15090 transitions. Word has length 93 [2018-12-08 16:52:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:31,939 INFO L480 AbstractCegarLoop]: Abstraction has 6634 states and 15090 transitions. [2018-12-08 16:52:31,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6634 states and 15090 transitions. [2018-12-08 16:52:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:31,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:31,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:52:31,943 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:31,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1495988156, now seen corresponding path program 1 times [2018-12-08 16:52:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:31,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:31,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:31,976 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 16:52:31,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:31,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:52:31,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:31,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:52:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:52:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:52:31,977 INFO L87 Difference]: Start difference. First operand 6634 states and 15090 transitions. Second operand 5 states. [2018-12-08 16:52:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:32,165 INFO L93 Difference]: Finished difference Result 7882 states and 17730 transitions. [2018-12-08 16:52:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:52:32,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-08 16:52:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:32,170 INFO L225 Difference]: With dead ends: 7882 [2018-12-08 16:52:32,170 INFO L226 Difference]: Without dead ends: 7751 [2018-12-08 16:52:32,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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 16:52:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7751 states. [2018-12-08 16:52:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7751 to 7373. [2018-12-08 16:52:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7373 states. [2018-12-08 16:52:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 16709 transitions. [2018-12-08 16:52:32,223 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 16709 transitions. Word has length 93 [2018-12-08 16:52:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:32,223 INFO L480 AbstractCegarLoop]: Abstraction has 7373 states and 16709 transitions. [2018-12-08 16:52:32,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:52:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 16709 transitions. [2018-12-08 16:52:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:32,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:32,228 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] [2018-12-08 16:52:32,228 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:32,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash -251223675, now seen corresponding path program 1 times [2018-12-08 16:52:32,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:32,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:32,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:32,271 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 16:52:32,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:32,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:52:32,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:32,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:52:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:52:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:52:32,272 INFO L87 Difference]: Start difference. First operand 7373 states and 16709 transitions. Second operand 6 states. [2018-12-08 16:52:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:32,450 INFO L93 Difference]: Finished difference Result 9406 states and 21103 transitions. [2018-12-08 16:52:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:52:32,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-08 16:52:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:32,456 INFO L225 Difference]: With dead ends: 9406 [2018-12-08 16:52:32,456 INFO L226 Difference]: Without dead ends: 9298 [2018-12-08 16:52:32,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:52:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states. [2018-12-08 16:52:32,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 7200. [2018-12-08 16:52:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7200 states. [2018-12-08 16:52:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 16315 transitions. [2018-12-08 16:52:32,514 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 16315 transitions. Word has length 93 [2018-12-08 16:52:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:32,514 INFO L480 AbstractCegarLoop]: Abstraction has 7200 states and 16315 transitions. [2018-12-08 16:52:32,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:52:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 16315 transitions. [2018-12-08 16:52:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:32,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:32,519 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] [2018-12-08 16:52:32,519 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:32,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1344833246, now seen corresponding path program 1 times [2018-12-08 16:52:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:32,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:32,608 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 16:52:32,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:32,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:52:32,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:32,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:52:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:52:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:52:32,609 INFO L87 Difference]: Start difference. First operand 7200 states and 16315 transitions. Second operand 9 states. [2018-12-08 16:52:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:32,916 INFO L93 Difference]: Finished difference Result 10191 states and 23070 transitions. [2018-12-08 16:52:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 16:52:32,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-08 16:52:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:32,922 INFO L225 Difference]: With dead ends: 10191 [2018-12-08 16:52:32,922 INFO L226 Difference]: Without dead ends: 10159 [2018-12-08 16:52:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-08 16:52:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10159 states. [2018-12-08 16:52:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10159 to 9008. [2018-12-08 16:52:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2018-12-08 16:52:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 20407 transitions. [2018-12-08 16:52:32,989 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 20407 transitions. Word has length 93 [2018-12-08 16:52:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:32,989 INFO L480 AbstractCegarLoop]: Abstraction has 9008 states and 20407 transitions. [2018-12-08 16:52:32,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:52:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 20407 transitions. [2018-12-08 16:52:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:32,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:32,998 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] [2018-12-08 16:52:32,998 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:32,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1153182691, now seen corresponding path program 1 times [2018-12-08 16:52:32,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:33,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 16:52:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:33,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:52:33,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:33,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:52:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:52:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:52:33,082 INFO L87 Difference]: Start difference. First operand 9008 states and 20407 transitions. Second operand 8 states. [2018-12-08 16:52:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:33,314 INFO L93 Difference]: Finished difference Result 14357 states and 33169 transitions. [2018-12-08 16:52:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 16:52:33,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-08 16:52:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:33,323 INFO L225 Difference]: With dead ends: 14357 [2018-12-08 16:52:33,323 INFO L226 Difference]: Without dead ends: 14357 [2018-12-08 16:52:33,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 16:52:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14357 states. [2018-12-08 16:52:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14357 to 9634. [2018-12-08 16:52:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2018-12-08 16:52:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 22044 transitions. [2018-12-08 16:52:33,414 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 22044 transitions. Word has length 93 [2018-12-08 16:52:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:33,414 INFO L480 AbstractCegarLoop]: Abstraction has 9634 states and 22044 transitions. [2018-12-08 16:52:33,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:52:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 22044 transitions. [2018-12-08 16:52:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:33,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:33,421 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] [2018-12-08 16:52:33,421 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:33,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2040686372, now seen corresponding path program 1 times [2018-12-08 16:52:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:33,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:52:33,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:33,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:52:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:52:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:52:33,496 INFO L87 Difference]: Start difference. First operand 9634 states and 22044 transitions. Second operand 7 states. [2018-12-08 16:52:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:33,612 INFO L93 Difference]: Finished difference Result 13692 states and 31671 transitions. [2018-12-08 16:52:33,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:33,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-08 16:52:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:33,621 INFO L225 Difference]: With dead ends: 13692 [2018-12-08 16:52:33,621 INFO L226 Difference]: Without dead ends: 13692 [2018-12-08 16:52:33,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-08 16:52:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2018-12-08 16:52:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 9705. [2018-12-08 16:52:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9705 states. [2018-12-08 16:52:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9705 states to 9705 states and 22008 transitions. [2018-12-08 16:52:33,702 INFO L78 Accepts]: Start accepts. Automaton has 9705 states and 22008 transitions. Word has length 93 [2018-12-08 16:52:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:33,703 INFO L480 AbstractCegarLoop]: Abstraction has 9705 states and 22008 transitions. [2018-12-08 16:52:33,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:52:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9705 states and 22008 transitions. [2018-12-08 16:52:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:52:33,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:33,709 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] [2018-12-08 16:52:33,710 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:33,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 308710820, now seen corresponding path program 1 times [2018-12-08 16:52:33,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:33,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:33,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:52:33,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:33,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:52:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:52:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:52:33,765 INFO L87 Difference]: Start difference. First operand 9705 states and 22008 transitions. Second operand 6 states. [2018-12-08 16:52:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:33,855 INFO L93 Difference]: Finished difference Result 9433 states and 21056 transitions. [2018-12-08 16:52:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:52:33,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-08 16:52:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:33,862 INFO L225 Difference]: With dead ends: 9433 [2018-12-08 16:52:33,862 INFO L226 Difference]: Without dead ends: 9433 [2018-12-08 16:52:33,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:52:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2018-12-08 16:52:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 5737. [2018-12-08 16:52:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2018-12-08 16:52:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 12775 transitions. [2018-12-08 16:52:33,922 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 12775 transitions. Word has length 93 [2018-12-08 16:52:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:33,922 INFO L480 AbstractCegarLoop]: Abstraction has 5737 states and 12775 transitions. [2018-12-08 16:52:33,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:52:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 12775 transitions. [2018-12-08 16:52:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:52:33,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:33,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:52:33,926 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:33,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash -427799985, now seen corresponding path program 1 times [2018-12-08 16:52:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:33,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:52:34,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:34,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 16:52:34,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:34,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 16:52:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 16:52:34,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-08 16:52:34,049 INFO L87 Difference]: Start difference. First operand 5737 states and 12775 transitions. Second operand 13 states. [2018-12-08 16:52:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:34,583 INFO L93 Difference]: Finished difference Result 7885 states and 17281 transitions. [2018-12-08 16:52:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 16:52:34,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-12-08 16:52:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:34,587 INFO L225 Difference]: With dead ends: 7885 [2018-12-08 16:52:34,587 INFO L226 Difference]: Without dead ends: 7885 [2018-12-08 16:52:34,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-08 16:52:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7885 states. [2018-12-08 16:52:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7885 to 6454. [2018-12-08 16:52:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2018-12-08 16:52:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14329 transitions. [2018-12-08 16:52:34,635 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14329 transitions. Word has length 95 [2018-12-08 16:52:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:34,635 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14329 transitions. [2018-12-08 16:52:34,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 16:52:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14329 transitions. [2018-12-08 16:52:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:52:34,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:34,639 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] [2018-12-08 16:52:34,639 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:34,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash 459703696, now seen corresponding path program 1 times [2018-12-08 16:52:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:34,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:34,733 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 16:52:34,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:34,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 16:52:34,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:34,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 16:52:34,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 16:52:34,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 16:52:34,734 INFO L87 Difference]: Start difference. First operand 6454 states and 14329 transitions. Second operand 11 states. [2018-12-08 16:52:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:35,927 INFO L93 Difference]: Finished difference Result 12191 states and 27204 transitions. [2018-12-08 16:52:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 16:52:35,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-08 16:52:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:35,935 INFO L225 Difference]: With dead ends: 12191 [2018-12-08 16:52:35,935 INFO L226 Difference]: Without dead ends: 8442 [2018-12-08 16:52:35,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-08 16:52:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8442 states. [2018-12-08 16:52:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8442 to 6319. [2018-12-08 16:52:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6319 states. [2018-12-08 16:52:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6319 states to 6319 states and 13986 transitions. [2018-12-08 16:52:35,992 INFO L78 Accepts]: Start accepts. Automaton has 6319 states and 13986 transitions. Word has length 95 [2018-12-08 16:52:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:35,993 INFO L480 AbstractCegarLoop]: Abstraction has 6319 states and 13986 transitions. [2018-12-08 16:52:35,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 16:52:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6319 states and 13986 transitions. [2018-12-08 16:52:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:52:35,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:35,997 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] [2018-12-08 16:52:35,997 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:35,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:35,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1345787232, now seen corresponding path program 1 times [2018-12-08 16:52:35,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:35,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:35,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:35,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:35,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:36,054 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 16:52:36,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:52:36,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:36,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:52:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:52:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:52:36,055 INFO L87 Difference]: Start difference. First operand 6319 states and 13986 transitions. Second operand 7 states. [2018-12-08 16:52:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:36,285 INFO L93 Difference]: Finished difference Result 7700 states and 16861 transitions. [2018-12-08 16:52:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:52:36,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-08 16:52:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:36,290 INFO L225 Difference]: With dead ends: 7700 [2018-12-08 16:52:36,290 INFO L226 Difference]: Without dead ends: 7680 [2018-12-08 16:52:36,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:52:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7680 states. [2018-12-08 16:52:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7680 to 6601. [2018-12-08 16:52:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2018-12-08 16:52:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 14528 transitions. [2018-12-08 16:52:36,337 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 14528 transitions. Word has length 95 [2018-12-08 16:52:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:36,337 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 14528 transitions. [2018-12-08 16:52:36,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:52:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 14528 transitions. [2018-12-08 16:52:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:52:36,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:36,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:36,342 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:36,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2131043360, now seen corresponding path program 2 times [2018-12-08 16:52:36,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:52:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:36,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:36,393 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 16:52:36,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:36,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:52:36,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:36,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:52:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:52:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:52:36,393 INFO L87 Difference]: Start difference. First operand 6601 states and 14528 transitions. Second operand 6 states. [2018-12-08 16:52:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:36,505 INFO L93 Difference]: Finished difference Result 7044 states and 15368 transitions. [2018-12-08 16:52:36,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:52:36,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-08 16:52:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:36,510 INFO L225 Difference]: With dead ends: 7044 [2018-12-08 16:52:36,510 INFO L226 Difference]: Without dead ends: 7044 [2018-12-08 16:52:36,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:52:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7044 states. [2018-12-08 16:52:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7044 to 6400. [2018-12-08 16:52:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6400 states. [2018-12-08 16:52:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6400 states to 6400 states and 14037 transitions. [2018-12-08 16:52:36,559 INFO L78 Accepts]: Start accepts. Automaton has 6400 states and 14037 transitions. Word has length 95 [2018-12-08 16:52:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:36,560 INFO L480 AbstractCegarLoop]: Abstraction has 6400 states and 14037 transitions. [2018-12-08 16:52:36,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:52:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6400 states and 14037 transitions. [2018-12-08 16:52:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:52:36,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:36,564 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] [2018-12-08 16:52:36,564 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:36,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552993, now seen corresponding path program 2 times [2018-12-08 16:52:36,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:36,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:52:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:36,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:52:36,646 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 16:52:36,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:52:36,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:52:36,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:52:36,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:52:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:52:36,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:52:36,647 INFO L87 Difference]: Start difference. First operand 6400 states and 14037 transitions. Second operand 8 states. [2018-12-08 16:52:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:52:36,858 INFO L93 Difference]: Finished difference Result 7755 states and 16955 transitions. [2018-12-08 16:52:36,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 16:52:36,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-08 16:52:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:52:36,864 INFO L225 Difference]: With dead ends: 7755 [2018-12-08 16:52:36,864 INFO L226 Difference]: Without dead ends: 7755 [2018-12-08 16:52:36,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-08 16:52:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2018-12-08 16:52:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 6621. [2018-12-08 16:52:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6621 states. [2018-12-08 16:52:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6621 states to 6621 states and 14513 transitions. [2018-12-08 16:52:36,920 INFO L78 Accepts]: Start accepts. Automaton has 6621 states and 14513 transitions. Word has length 95 [2018-12-08 16:52:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:52:36,920 INFO L480 AbstractCegarLoop]: Abstraction has 6621 states and 14513 transitions. [2018-12-08 16:52:36,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:52:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6621 states and 14513 transitions. [2018-12-08 16:52:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:52:36,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:52:36,925 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] [2018-12-08 16:52:36,925 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:52:36,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:52:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1731910622, now seen corresponding path program 2 times [2018-12-08 16:52:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:52:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:36,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:52:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:52:36,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:52:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:52:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:52:36,970 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 16:52:37,046 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 16:52:37,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:52:37 BasicIcfg [2018-12-08 16:52:37,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:52:37,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:52:37,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:52:37,047 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:52:37,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:52:20" (3/4) ... [2018-12-08 16:52:37,049 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 16:52:37,149 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ac73f78-4481-478b-8c32-67e0d02a4938/bin-2019/utaipan/witness.graphml [2018-12-08 16:52:37,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:52:37,150 INFO L168 Benchmark]: Toolchain (without parser) took 17855.54 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 948.2 MB in the beginning and 1.2 GB in the end (delta: -202.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-08 16:52:37,151 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:52:37,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.2 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-08 16:52:37,152 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:52:37,152 INFO L168 Benchmark]: Boogie Preprocessor took 21.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:52:37,152 INFO L168 Benchmark]: RCFGBuilder took 353.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-08 16:52:37,152 INFO L168 Benchmark]: TraceAbstraction took 17017.65 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -135.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-08 16:52:37,153 INFO L168 Benchmark]: Witness Printer took 102.37 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-08 16:52:37,154 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.2 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17017.65 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -135.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 102.37 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 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] [L696] -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] [L697] -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] [L773] -1 pthread_t t1715; 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] [L774] FCALL, FORK -1 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) 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] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 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=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1716; 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1716, ((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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 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 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 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 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 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 [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -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) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -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 [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -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 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.9s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8631 SDtfs, 10013 SDslu, 21520 SDs, 0 SdLazy, 9839 SolverSat, 498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 89 SyntacticMatches, 33 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, 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: 4.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 90577 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2572 NumberOfCodeBlocks, 2572 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2444 ConstructedInterpolants, 0 QuantifiedInterpolants, 551455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...