./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --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_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/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 ccd6d122756047ddb1225c106ac06a6748e14c22 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:24:40,763 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:24:40,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:24:40,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:24:40,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:24:40,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:24:40,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:24:40,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:24:40,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:24:40,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:24:40,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:24:40,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:24:40,776 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:24:40,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:24:40,778 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:24:40,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:24:40,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:24:40,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:24:40,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:24:40,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:24:40,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:24:40,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:24:40,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:24:40,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:24:40,784 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:24:40,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:24:40,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:24:40,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:24:40,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:24:40,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:24:40,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:24:40,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:24:40,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:24:40,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:24:40,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:24:40,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:24:40,788 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:24:40,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:24:40,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:24:40,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:24:40,796 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:24:40,796 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:24:40,797 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:24:40,797 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:24:40,797 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:24:40,797 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:24:40,797 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:24:40,797 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:24:40,797 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:24:40,798 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:24:40,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:24:40,798 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:24:40,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:24:40,799 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:24:40,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:24:40,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:24:40,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:24:40,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:24:40,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:24:40,800 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:24:40,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:24:40,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:24:40,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:24:40,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:24:40,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:24:40,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:24:40,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:24:40,802 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_ad62c07e-fd32-44ce-bc34-7bac01fe972e/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-12-08 17:24:40,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:24:40,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:24:40,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:24:40,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:24:40,832 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:24:40,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 17:24:40,865 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/data/4f894a623/349c483d49a14590a4c372c8e470f0c0/FLAG4a479de57 [2018-12-08 17:24:41,155 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:24:41,155 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 17:24:41,159 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/data/4f894a623/349c483d49a14590a4c372c8e470f0c0/FLAG4a479de57 [2018-12-08 17:24:41,589 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/data/4f894a623/349c483d49a14590a4c372c8e470f0c0 [2018-12-08 17:24:41,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:24:41,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:24:41,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:24:41,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:24:41,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:24:41,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602de2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41, skipping insertion in model container [2018-12-08 17:24:41,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:24:41,615 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:24:41,712 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:24:41,715 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:24:41,727 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:24:41,734 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:24:41,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41 WrapperNode [2018-12-08 17:24:41,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:24:41,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:24:41,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:24:41,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:24:41,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:24:41,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:24:41,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:24:41,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:24:41,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... [2018-12-08 17:24:41,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:24:41,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:24:41,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:24:41,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:24:41,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/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 17:24:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:24:41,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:24:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:24:41,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:24:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:24:41,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:24:41,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:24:41,949 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 17:24:41,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:24:41 BoogieIcfgContainer [2018-12-08 17:24:41,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:24:41,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:24:41,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:24:41,952 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:24:41,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:24:41" (1/3) ... [2018-12-08 17:24:41,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fdc49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:24:41, skipping insertion in model container [2018-12-08 17:24:41,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:24:41" (2/3) ... [2018-12-08 17:24:41,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fdc49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:24:41, skipping insertion in model container [2018-12-08 17:24:41,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:24:41" (3/3) ... [2018-12-08 17:24:41,954 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 17:24:41,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:24:41,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:24:41,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:24:41,993 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:24:41,993 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:24:41,993 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:24:41,993 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:24:41,993 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:24:41,993 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:24:41,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:24:41,994 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:24:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-12-08 17:24:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 17:24:42,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,011 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2018-12-08 17:24:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,112 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 17:24:42,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,127 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-12-08 17:24:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,152 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-12-08 17:24:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-08 17:24:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,159 INFO L225 Difference]: With dead ends: 69 [2018-12-08 17:24:42,159 INFO L226 Difference]: Without dead ends: 54 [2018-12-08 17:24:42,161 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 17:24:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-08 17:24:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-12-08 17:24:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-08 17:24:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-12-08 17:24:42,184 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2018-12-08 17:24:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,184 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2018-12-08 17:24:42,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2018-12-08 17:24:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 17:24:42,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2018-12-08 17:24:42,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,207 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 17:24:42,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,209 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2018-12-08 17:24:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,221 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-12-08 17:24:42,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-08 17:24:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,223 INFO L225 Difference]: With dead ends: 87 [2018-12-08 17:24:42,223 INFO L226 Difference]: Without dead ends: 54 [2018-12-08 17:24:42,223 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 17:24:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-08 17:24:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-08 17:24:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-08 17:24:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-12-08 17:24:42,228 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2018-12-08 17:24:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,228 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2018-12-08 17:24:42,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2018-12-08 17:24:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 17:24:42,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2018-12-08 17:24:42,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,248 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 17:24:42,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,249 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2018-12-08 17:24:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,266 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2018-12-08 17:24:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-08 17:24:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,267 INFO L225 Difference]: With dead ends: 81 [2018-12-08 17:24:42,267 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 17:24:42,268 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 17:24:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 17:24:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-08 17:24:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 17:24:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-12-08 17:24:42,271 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2018-12-08 17:24:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,272 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2018-12-08 17:24:42,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2018-12-08 17:24:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 17:24:42,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,272 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2018-12-08 17:24:42,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,292 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 17:24:42,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,293 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2018-12-08 17:24:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,304 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2018-12-08 17:24:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-08 17:24:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,305 INFO L225 Difference]: With dead ends: 100 [2018-12-08 17:24:42,305 INFO L226 Difference]: Without dead ends: 98 [2018-12-08 17:24:42,305 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 17:24:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-08 17:24:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-12-08 17:24:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-08 17:24:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2018-12-08 17:24:42,310 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2018-12-08 17:24:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,310 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2018-12-08 17:24:42,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2018-12-08 17:24:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 17:24:42,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2018-12-08 17:24:42,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,326 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 17:24:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,327 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2018-12-08 17:24:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,339 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2018-12-08 17:24:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-08 17:24:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,340 INFO L225 Difference]: With dead ends: 164 [2018-12-08 17:24:42,340 INFO L226 Difference]: Without dead ends: 100 [2018-12-08 17:24:42,341 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 17:24:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-08 17:24:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-12-08 17:24:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 17:24:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2018-12-08 17:24:42,345 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2018-12-08 17:24:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,346 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2018-12-08 17:24:42,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2018-12-08 17:24:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:24:42,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2018-12-08 17:24:42,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:42,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,364 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2018-12-08 17:24:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,372 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2018-12-08 17:24:42,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-08 17:24:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,373 INFO L225 Difference]: With dead ends: 147 [2018-12-08 17:24:42,373 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 17:24:42,374 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 17:24:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 17:24:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-08 17:24:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 17:24:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2018-12-08 17:24:42,380 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2018-12-08 17:24:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,381 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2018-12-08 17:24:42,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2018-12-08 17:24:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:24:42,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2018-12-08 17:24:42,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,395 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 17:24:42,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,396 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2018-12-08 17:24:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,407 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2018-12-08 17:24:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-08 17:24:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,409 INFO L225 Difference]: With dead ends: 180 [2018-12-08 17:24:42,409 INFO L226 Difference]: Without dead ends: 178 [2018-12-08 17:24:42,409 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 17:24:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-08 17:24:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-12-08 17:24:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 17:24:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2018-12-08 17:24:42,418 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2018-12-08 17:24:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,418 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2018-12-08 17:24:42,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2018-12-08 17:24:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:24:42,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,419 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2018-12-08 17:24:42,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,435 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 17:24:42,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,437 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2018-12-08 17:24:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,453 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-12-08 17:24:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-08 17:24:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,454 INFO L225 Difference]: With dead ends: 312 [2018-12-08 17:24:42,454 INFO L226 Difference]: Without dead ends: 186 [2018-12-08 17:24:42,454 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 17:24:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-08 17:24:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-12-08 17:24:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 17:24:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2018-12-08 17:24:42,461 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2018-12-08 17:24:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,461 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2018-12-08 17:24:42,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2018-12-08 17:24:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 17:24:42,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,462 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] [2018-12-08 17:24:42,462 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2018-12-08 17:24:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,479 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 17:24:42,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,480 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2018-12-08 17:24:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,491 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2018-12-08 17:24:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 17:24:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,492 INFO L225 Difference]: With dead ends: 276 [2018-12-08 17:24:42,492 INFO L226 Difference]: Without dead ends: 190 [2018-12-08 17:24:42,493 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 17:24:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-08 17:24:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-12-08 17:24:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-08 17:24:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2018-12-08 17:24:42,499 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2018-12-08 17:24:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,500 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2018-12-08 17:24:42,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2018-12-08 17:24:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 17:24:42,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,501 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] [2018-12-08 17:24:42,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2018-12-08 17:24:42,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,514 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 17:24:42,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,515 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2018-12-08 17:24:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,527 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2018-12-08 17:24:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 17:24:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,528 INFO L225 Difference]: With dead ends: 332 [2018-12-08 17:24:42,529 INFO L226 Difference]: Without dead ends: 330 [2018-12-08 17:24:42,529 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 17:24:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-08 17:24:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2018-12-08 17:24:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-08 17:24:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2018-12-08 17:24:42,536 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2018-12-08 17:24:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,536 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2018-12-08 17:24:42,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2018-12-08 17:24:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 17:24:42,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,537 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] [2018-12-08 17:24:42,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2018-12-08 17:24:42,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,551 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 17:24:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,552 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2018-12-08 17:24:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,571 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2018-12-08 17:24:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 17:24:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,572 INFO L225 Difference]: With dead ends: 604 [2018-12-08 17:24:42,573 INFO L226 Difference]: Without dead ends: 354 [2018-12-08 17:24:42,573 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 17:24:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-08 17:24:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-12-08 17:24:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-08 17:24:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2018-12-08 17:24:42,583 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2018-12-08 17:24:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,584 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2018-12-08 17:24:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2018-12-08 17:24:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:24:42,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,585 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] [2018-12-08 17:24:42,585 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2018-12-08 17:24:42,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,603 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 17:24:42,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,604 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2018-12-08 17:24:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,621 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2018-12-08 17:24:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 17:24:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,622 INFO L225 Difference]: With dead ends: 528 [2018-12-08 17:24:42,623 INFO L226 Difference]: Without dead ends: 362 [2018-12-08 17:24:42,623 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 17:24:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-12-08 17:24:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-12-08 17:24:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-08 17:24:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2018-12-08 17:24:42,633 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2018-12-08 17:24:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,633 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2018-12-08 17:24:42,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2018-12-08 17:24:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:24:42,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,634 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] [2018-12-08 17:24:42,634 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2018-12-08 17:24:42,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,648 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 17:24:42,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,649 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2018-12-08 17:24:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,671 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2018-12-08 17:24:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 17:24:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,673 INFO L225 Difference]: With dead ends: 620 [2018-12-08 17:24:42,673 INFO L226 Difference]: Without dead ends: 618 [2018-12-08 17:24:42,674 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 17:24:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-08 17:24:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-12-08 17:24:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-08 17:24:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2018-12-08 17:24:42,692 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2018-12-08 17:24:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,692 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2018-12-08 17:24:42,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2018-12-08 17:24:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:24:42,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,694 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] [2018-12-08 17:24:42,694 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2018-12-08 17:24:42,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,707 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 17:24:42,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,709 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2018-12-08 17:24:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,736 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2018-12-08 17:24:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 17:24:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,738 INFO L225 Difference]: With dead ends: 1180 [2018-12-08 17:24:42,738 INFO L226 Difference]: Without dead ends: 682 [2018-12-08 17:24:42,739 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 17:24:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-08 17:24:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-12-08 17:24:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-08 17:24:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2018-12-08 17:24:42,753 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2018-12-08 17:24:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,754 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2018-12-08 17:24:42,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2018-12-08 17:24:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:24:42,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,755 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] [2018-12-08 17:24:42,755 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,755 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2018-12-08 17:24:42,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,767 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 17:24:42,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,768 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2018-12-08 17:24:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,790 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2018-12-08 17:24:42,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 17:24:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,792 INFO L225 Difference]: With dead ends: 1020 [2018-12-08 17:24:42,792 INFO L226 Difference]: Without dead ends: 698 [2018-12-08 17:24:42,793 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 17:24:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-08 17:24:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-12-08 17:24:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-08 17:24:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2018-12-08 17:24:42,816 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2018-12-08 17:24:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,816 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2018-12-08 17:24:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2018-12-08 17:24:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:24:42,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,818 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] [2018-12-08 17:24:42,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2018-12-08 17:24:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,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 17:24:42,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,831 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2018-12-08 17:24:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,862 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2018-12-08 17:24:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 17:24:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,866 INFO L225 Difference]: With dead ends: 1164 [2018-12-08 17:24:42,866 INFO L226 Difference]: Without dead ends: 1162 [2018-12-08 17:24:42,867 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 17:24:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-12-08 17:24:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2018-12-08 17:24:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-12-08 17:24:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2018-12-08 17:24:42,893 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2018-12-08 17:24:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,893 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2018-12-08 17:24:42,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2018-12-08 17:24:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:24:42,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:42,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:24:42,894 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:42,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2018-12-08 17:24:42,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:42,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:42,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:42,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:42,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:42,907 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2018-12-08 17:24:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:42,947 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2018-12-08 17:24:42,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:42,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 17:24:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:42,951 INFO L225 Difference]: With dead ends: 2316 [2018-12-08 17:24:42,951 INFO L226 Difference]: Without dead ends: 1322 [2018-12-08 17:24:42,953 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 17:24:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-12-08 17:24:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2018-12-08 17:24:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-12-08 17:24:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2018-12-08 17:24:42,998 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2018-12-08 17:24:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:42,999 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2018-12-08 17:24:42,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2018-12-08 17:24:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:24:43,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:43,001 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] [2018-12-08 17:24:43,001 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:43,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2018-12-08 17:24:43,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:43,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:43,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:43,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:43,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:43,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:43,013 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2018-12-08 17:24:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:43,057 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2018-12-08 17:24:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:43,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 17:24:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:43,060 INFO L225 Difference]: With dead ends: 1980 [2018-12-08 17:24:43,061 INFO L226 Difference]: Without dead ends: 1354 [2018-12-08 17:24:43,061 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 17:24:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-08 17:24:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-12-08 17:24:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-08 17:24:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2018-12-08 17:24:43,101 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2018-12-08 17:24:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:43,102 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2018-12-08 17:24:43,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2018-12-08 17:24:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:24:43,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:43,103 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] [2018-12-08 17:24:43,104 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:43,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2018-12-08 17:24:43,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:43,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:43,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:43,115 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 17:24:43,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:43,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:43,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:43,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:43,116 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2018-12-08 17:24:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:43,167 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2018-12-08 17:24:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:43,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 17:24:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:43,172 INFO L225 Difference]: With dead ends: 2186 [2018-12-08 17:24:43,172 INFO L226 Difference]: Without dead ends: 2184 [2018-12-08 17:24:43,173 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 17:24:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-12-08 17:24:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2018-12-08 17:24:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-12-08 17:24:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2018-12-08 17:24:43,222 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2018-12-08 17:24:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:43,222 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2018-12-08 17:24:43,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2018-12-08 17:24:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:24:43,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:24:43,225 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] [2018-12-08 17:24:43,225 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:24:43,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:24:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2018-12-08 17:24:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:24:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:43,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:24:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:24:43,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:24:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:43,233 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 17:24:43,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:24:43,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:24:43,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:24:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:24:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:24:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:24:43,234 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2018-12-08 17:24:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:24:43,292 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2018-12-08 17:24:43,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:24:43,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 17:24:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:24:43,292 INFO L225 Difference]: With dead ends: 4552 [2018-12-08 17:24:43,292 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 17:24:43,295 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 17:24:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 17:24:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 17:24:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 17:24:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 17:24:43,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-08 17:24:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:24:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:24:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:24:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:24:43,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 17:24:43,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 17:24:43,310 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 17:24:43,310 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 17:24:43,310 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 17:24:43,310 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 17:24:43,310 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 17:24:43,310 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 17:24:43,310 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-12-08 17:24:43,310 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,311 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,312 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-12-08 17:24:43,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:24:43 BoogieIcfgContainer [2018-12-08 17:24:43,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:24:43,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:24:43,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:24:43,318 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:24:43,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:24:41" (3/4) ... [2018-12-08 17:24:43,322 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 17:24:43,327 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 17:24:43,328 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 17:24:43,331 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 17:24:43,331 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 17:24:43,331 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 17:24:43,365 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ad62c07e-fd32-44ce-bc34-7bac01fe972e/bin-2019/utaipan/witness.graphml [2018-12-08 17:24:43,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:24:43,365 INFO L168 Benchmark]: Toolchain (without parser) took 1773.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 949.7 MB in the beginning and 978.7 MB in the end (delta: -29.0 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:24:43,366 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:24:43,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.58 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:24:43,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.76 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:24:43,367 INFO L168 Benchmark]: Boogie Preprocessor took 43.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:24:43,367 INFO L168 Benchmark]: RCFGBuilder took 158.94 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:24:43,367 INFO L168 Benchmark]: TraceAbstraction took 1368.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.6 MB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:24:43,367 INFO L168 Benchmark]: Witness Printer took 46.56 ms. Allocated memory is still 1.1 GB. Free memory was 985.6 MB in the beginning and 978.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:24:43,369 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.58 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.76 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.94 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1368.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.6 MB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. * Witness Printer took 46.56 ms. Allocated memory is still 1.1 GB. Free memory was 985.6 MB in the beginning and 978.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. SAFE Result, 1.3s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...