./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_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_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/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 c5a3d22d49117f02662b197492bc1b16616a2878 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:22:19,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:22:19,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:22:19,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:22:19,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:22:19,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:22:19,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:22:19,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:22:19,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:22:19,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:22:19,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:22:19,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:22:19,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:22:19,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:22:19,822 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:22:19,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:22:19,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:22:19,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:22:19,824 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:22:19,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:22:19,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:22:19,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:22:19,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:22:19,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:22:19,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:22:19,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:22:19,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:22:19,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:22:19,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:22:19,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:22:19,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:22:19,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:22:19,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:22:19,831 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:22:19,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:22:19,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:22:19,832 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:22:19,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:22:19,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:22:19,840 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:22:19,840 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:22:19,840 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:22:19,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:22:19,841 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:22:19,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:22:19,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:22:19,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:22:19,843 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_d6ebba27-c43d-4968-96b0-46d9e43c2f23/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-12-09 19:22:19,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:22:19,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:22:19,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:22:19,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:22:19,874 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:22:19,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:22:19,918 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/data/74c0890ce/97c681cf8d1446b4b66e61625f7aab71/FLAG64a3ae49a [2018-12-09 19:22:20,320 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:22:20,321 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:22:20,325 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/data/74c0890ce/97c681cf8d1446b4b66e61625f7aab71/FLAG64a3ae49a [2018-12-09 19:22:20,333 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/data/74c0890ce/97c681cf8d1446b4b66e61625f7aab71 [2018-12-09 19:22:20,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:22:20,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:22:20,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:22:20,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:22:20,340 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:22:20,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e47f778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20, skipping insertion in model container [2018-12-09 19:22:20,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:22:20,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:22:20,468 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:22:20,470 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:22:20,488 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:22:20,496 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:22:20,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20 WrapperNode [2018-12-09 19:22:20,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:22:20,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:22:20,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:22:20,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:22:20,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:22:20,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:22:20,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:22:20,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:22:20,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... [2018-12-09 19:22:20,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:22:20,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:22:20,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:22:20,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:22:20,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/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-09 19:22:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:22:20,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:22:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:22:20,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:22:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:22:20,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:22:20,765 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:22:20,765 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:22:20,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:20 BoogieIcfgContainer [2018-12-09 19:22:20,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:22:20,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:22:20,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:22:20,768 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:22:20,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:22:20" (1/3) ... [2018-12-09 19:22:20,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c675aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:22:20, skipping insertion in model container [2018-12-09 19:22:20,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:20" (2/3) ... [2018-12-09 19:22:20,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c675aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:22:20, skipping insertion in model container [2018-12-09 19:22:20,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:20" (3/3) ... [2018-12-09 19:22:20,769 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:22:20,775 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:22:20,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:22:20,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:22:20,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:22:20,806 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:22:20,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:22:20,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:22:20,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:22:20,806 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:22:20,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:22:20,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:22:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-12-09 19:22:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:22:20,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:20,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:20,821 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:20,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-12-09 19:22:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:20,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:20,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:20,926 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-09 19:22:20,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:20,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:20,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:20,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:20,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:20,940 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-12-09 19:22:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:20,967 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-12-09 19:22:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:20,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:22:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:20,975 INFO L225 Difference]: With dead ends: 111 [2018-12-09 19:22:20,975 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 19:22:20,977 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-09 19:22:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 19:22:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-12-09 19:22:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 19:22:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-12-09 19:22:21,001 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-12-09 19:22:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,001 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-12-09 19:22:21,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-12-09 19:22:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:22:21,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,002 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-12-09 19:22:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,034 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-09 19:22:21,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,035 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-12-09 19:22:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,055 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-12-09 19:22:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:22:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,056 INFO L225 Difference]: With dead ends: 157 [2018-12-09 19:22:21,056 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 19:22:21,057 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-09 19:22:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 19:22:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-09 19:22:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 19:22:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-12-09 19:22:21,062 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-12-09 19:22:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,062 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-12-09 19:22:21,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-12-09 19:22:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:22:21,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-12-09 19:22:21,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,085 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-09 19:22:21,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,086 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-12-09 19:22:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,096 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-12-09 19:22:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:22:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,097 INFO L225 Difference]: With dead ends: 144 [2018-12-09 19:22:21,097 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 19:22:21,098 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-09 19:22:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 19:22:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-09 19:22:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 19:22:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-12-09 19:22:21,102 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-12-09 19:22:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,103 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-12-09 19:22:21,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-12-09 19:22:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:22:21,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,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, 1, 1] [2018-12-09 19:22:21,103 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-12-09 19:22:21,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,123 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-09 19:22:21,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,124 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-12-09 19:22:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,134 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-12-09 19:22:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:22:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,135 INFO L225 Difference]: With dead ends: 184 [2018-12-09 19:22:21,135 INFO L226 Difference]: Without dead ends: 182 [2018-12-09 19:22:21,135 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-09 19:22:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-09 19:22:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-12-09 19:22:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-09 19:22:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-12-09 19:22:21,141 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-12-09 19:22:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,141 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-12-09 19:22:21,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-12-09 19:22:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:22:21,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,142 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-12-09 19:22:21,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:22:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,167 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-12-09 19:22:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,181 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-12-09 19:22:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:22:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,182 INFO L225 Difference]: With dead ends: 304 [2018-12-09 19:22:21,182 INFO L226 Difference]: Without dead ends: 184 [2018-12-09 19:22:21,183 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-09 19:22:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-09 19:22:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-12-09 19:22:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-09 19:22:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-12-09 19:22:21,193 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-12-09 19:22:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,193 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-12-09 19:22:21,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-12-09 19:22:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:22:21,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,194 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-12-09 19:22:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,226 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-09 19:22:21,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,228 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-12-09 19:22:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,241 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-12-09 19:22:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:22:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,242 INFO L225 Difference]: With dead ends: 273 [2018-12-09 19:22:21,242 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 19:22:21,243 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-09 19:22:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 19:22:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-12-09 19:22:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-09 19:22:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-12-09 19:22:21,251 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-12-09 19:22:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,252 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-12-09 19:22:21,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-12-09 19:22:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:22:21,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,253 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-12-09 19:22:21,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,273 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-09 19:22:21,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,275 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-12-09 19:22:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,288 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-12-09 19:22:21,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:22:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,289 INFO L225 Difference]: With dead ends: 348 [2018-12-09 19:22:21,289 INFO L226 Difference]: Without dead ends: 346 [2018-12-09 19:22:21,290 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-09 19:22:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-09 19:22:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-12-09 19:22:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-09 19:22:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-12-09 19:22:21,299 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-12-09 19:22:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,299 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-12-09 19:22:21,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-12-09 19:22:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:22:21,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,301 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-12-09 19:22:21,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,318 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-09 19:22:21,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,319 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-12-09 19:22:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,333 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-12-09 19:22:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:22:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,335 INFO L225 Difference]: With dead ends: 592 [2018-12-09 19:22:21,335 INFO L226 Difference]: Without dead ends: 354 [2018-12-09 19:22:21,336 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-09 19:22:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-09 19:22:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-12-09 19:22:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-09 19:22:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-12-09 19:22:21,344 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-12-09 19:22:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,345 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-12-09 19:22:21,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-12-09 19:22:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:22:21,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,346 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-12-09 19:22:21,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,359 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-09 19:22:21,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,360 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-12-09 19:22:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,371 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-12-09 19:22:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:22:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,372 INFO L225 Difference]: With dead ends: 528 [2018-12-09 19:22:21,372 INFO L226 Difference]: Without dead ends: 358 [2018-12-09 19:22:21,373 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-09 19:22:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-09 19:22:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-12-09 19:22:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-09 19:22:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-12-09 19:22:21,380 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-12-09 19:22:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,380 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-12-09 19:22:21,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-12-09 19:22:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:22:21,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-12-09 19:22:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,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-09 19:22:21,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,397 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-12-09 19:22:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,414 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-12-09 19:22:21,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:22:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,416 INFO L225 Difference]: With dead ends: 668 [2018-12-09 19:22:21,416 INFO L226 Difference]: Without dead ends: 666 [2018-12-09 19:22:21,417 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-09 19:22:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-09 19:22:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-12-09 19:22:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-12-09 19:22:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-12-09 19:22:21,426 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-12-09 19:22:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,427 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-12-09 19:22:21,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-12-09 19:22:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:22:21,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,428 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-12-09 19:22:21,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,441 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-09 19:22:21,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,443 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-12-09 19:22:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,457 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-12-09 19:22:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:22:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,459 INFO L225 Difference]: With dead ends: 1164 [2018-12-09 19:22:21,459 INFO L226 Difference]: Without dead ends: 690 [2018-12-09 19:22:21,460 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-09 19:22:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-12-09 19:22:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-12-09 19:22:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-09 19:22:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-12-09 19:22:21,472 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-12-09 19:22:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,473 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-12-09 19:22:21,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-12-09 19:22:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:22:21,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,474 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-12-09 19:22:21,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,487 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-09 19:22:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,488 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-12-09 19:22:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,502 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-12-09 19:22:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:22:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,504 INFO L225 Difference]: With dead ends: 1032 [2018-12-09 19:22:21,504 INFO L226 Difference]: Without dead ends: 698 [2018-12-09 19:22:21,504 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-09 19:22:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-09 19:22:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-12-09 19:22:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-09 19:22:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-12-09 19:22:21,517 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-12-09 19:22:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,517 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-12-09 19:22:21,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-12-09 19:22:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:22:21,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,519 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-12-09 19:22:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,531 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-09 19:22:21,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,532 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-12-09 19:22:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,549 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-12-09 19:22:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:22:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,552 INFO L225 Difference]: With dead ends: 1292 [2018-12-09 19:22:21,552 INFO L226 Difference]: Without dead ends: 1290 [2018-12-09 19:22:21,553 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-09 19:22:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-09 19:22:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-12-09 19:22:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-09 19:22:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-12-09 19:22:21,570 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-12-09 19:22:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,570 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-12-09 19:22:21,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-12-09 19:22:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:22:21,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,572 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-12-09 19:22:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,583 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-09 19:22:21,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,585 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-12-09 19:22:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,606 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-12-09 19:22:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:22:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,609 INFO L225 Difference]: With dead ends: 2300 [2018-12-09 19:22:21,609 INFO L226 Difference]: Without dead ends: 1354 [2018-12-09 19:22:21,610 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-09 19:22:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-09 19:22:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-12-09 19:22:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-09 19:22:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-12-09 19:22:21,632 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-12-09 19:22:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,633 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-12-09 19:22:21,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-12-09 19:22:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:22:21,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,634 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-12-09 19:22:21,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,645 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-09 19:22:21,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,646 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-12-09 19:22:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,666 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-12-09 19:22:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:22:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,669 INFO L225 Difference]: With dead ends: 2028 [2018-12-09 19:22:21,669 INFO L226 Difference]: Without dead ends: 1370 [2018-12-09 19:22:21,670 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-09 19:22:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-12-09 19:22:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-12-09 19:22:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-12-09 19:22:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-12-09 19:22:21,692 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-12-09 19:22:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,693 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-12-09 19:22:21,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-12-09 19:22:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:22:21,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,694 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-12-09 19:22:21,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,704 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-09 19:22:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,705 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-12-09 19:22:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,728 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-12-09 19:22:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:22:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,732 INFO L225 Difference]: With dead ends: 2508 [2018-12-09 19:22:21,732 INFO L226 Difference]: Without dead ends: 2506 [2018-12-09 19:22:21,733 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-09 19:22:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-09 19:22:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-12-09 19:22:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-09 19:22:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-12-09 19:22:21,771 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-12-09 19:22:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,771 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-12-09 19:22:21,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-12-09 19:22:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:22:21,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,774 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-12-09 19:22:21,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,785 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-09 19:22:21,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,787 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-12-09 19:22:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,831 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-12-09 19:22:21,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:22:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,839 INFO L225 Difference]: With dead ends: 4556 [2018-12-09 19:22:21,839 INFO L226 Difference]: Without dead ends: 2666 [2018-12-09 19:22:21,842 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-09 19:22:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-12-09 19:22:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-12-09 19:22:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-12-09 19:22:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-12-09 19:22:21,921 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-12-09 19:22:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:21,921 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-12-09 19:22:21,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-12-09 19:22:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:22:21,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:21,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:21,923 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:21,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-12-09 19:22:21,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:21,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:22:21,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:21,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:21,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:21,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:21,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:21,942 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-12-09 19:22:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:21,969 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-12-09 19:22:21,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:21,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:22:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:21,974 INFO L225 Difference]: With dead ends: 3996 [2018-12-09 19:22:21,974 INFO L226 Difference]: Without dead ends: 2698 [2018-12-09 19:22:21,975 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-09 19:22:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-09 19:22:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-12-09 19:22:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-12-09 19:22:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-12-09 19:22:22,013 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-12-09 19:22:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:22,013 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-12-09 19:22:22,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-12-09 19:22:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:22:22,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:22,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:22,015 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:22,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-12-09 19:22:22,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:22,024 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-09 19:22:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:22,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:22,025 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-12-09 19:22:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:22,076 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-12-09 19:22:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:22,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:22:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:22,084 INFO L225 Difference]: With dead ends: 4876 [2018-12-09 19:22:22,084 INFO L226 Difference]: Without dead ends: 4874 [2018-12-09 19:22:22,086 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-09 19:22:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-09 19:22:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-12-09 19:22:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-12-09 19:22:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-12-09 19:22:22,148 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-12-09 19:22:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:22,148 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-12-09 19:22:22,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-12-09 19:22:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:22:22,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:22,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:22,151 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:22,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-12-09 19:22:22,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:22,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:22,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:22,163 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-09 19:22:22,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:22,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:22,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:22,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:22,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:22,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:22,164 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-12-09 19:22:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:22,224 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-12-09 19:22:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:22,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:22:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:22,239 INFO L225 Difference]: With dead ends: 9036 [2018-12-09 19:22:22,239 INFO L226 Difference]: Without dead ends: 5258 [2018-12-09 19:22:22,245 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-09 19:22:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-09 19:22:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-12-09 19:22:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-12-09 19:22:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-12-09 19:22:22,348 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-12-09 19:22:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:22,348 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-12-09 19:22:22,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-12-09 19:22:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:22:22,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:22,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:22,352 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:22,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-12-09 19:22:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:22,365 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-09 19:22:22,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:22,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:22,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:22,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:22,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:22,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:22,366 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-12-09 19:22:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:22,412 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-12-09 19:22:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:22,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:22:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:22,418 INFO L225 Difference]: With dead ends: 7884 [2018-12-09 19:22:22,418 INFO L226 Difference]: Without dead ends: 5322 [2018-12-09 19:22:22,421 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-09 19:22:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-12-09 19:22:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-12-09 19:22:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-12-09 19:22:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-12-09 19:22:22,487 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-12-09 19:22:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:22,487 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-12-09 19:22:22,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-12-09 19:22:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:22:22,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:22,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:22,490 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:22,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-12-09 19:22:22,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:22,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:22,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:22,498 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-09 19:22:22,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:22,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:22,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:22,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:22,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:22,499 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-12-09 19:22:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:22,604 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-12-09 19:22:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:22,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:22:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:22,616 INFO L225 Difference]: With dead ends: 15564 [2018-12-09 19:22:22,617 INFO L226 Difference]: Without dead ends: 10378 [2018-12-09 19:22:22,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-09 19:22:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-12-09 19:22:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-12-09 19:22:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-09 19:22:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-12-09 19:22:22,813 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-12-09 19:22:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:22,813 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-12-09 19:22:22,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-12-09 19:22:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:22:22,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:22,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:22,819 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:22,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-12-09 19:22:22,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:22,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:22,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:22,837 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-09 19:22:22,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:22,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:22,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:22,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:22,838 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-12-09 19:22:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:22,970 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-12-09 19:22:22,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:22,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:22:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:22,984 INFO L225 Difference]: With dead ends: 12172 [2018-12-09 19:22:22,984 INFO L226 Difference]: Without dead ends: 12170 [2018-12-09 19:22:22,988 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-09 19:22:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-09 19:22:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-12-09 19:22:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-09 19:22:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-12-09 19:22:23,141 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-12-09 19:22:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:23,141 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-12-09 19:22:23,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-12-09 19:22:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:22:23,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:23,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:23,146 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:23,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-12-09 19:22:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:23,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:23,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:23,158 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-09 19:22:23,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:23,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:23,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:23,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:23,159 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-12-09 19:22:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:23,288 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-12-09 19:22:23,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:23,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 19:22:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:23,307 INFO L225 Difference]: With dead ends: 18316 [2018-12-09 19:22:23,307 INFO L226 Difference]: Without dead ends: 18314 [2018-12-09 19:22:23,313 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-09 19:22:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-12-09 19:22:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-12-09 19:22:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-12-09 19:22:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-12-09 19:22:23,501 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-12-09 19:22:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:23,502 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-12-09 19:22:23,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-12-09 19:22:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:22:23,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:23,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:23,514 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:23,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:23,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-12-09 19:22:23,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:23,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:23,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:23,526 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-09 19:22:23,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:23,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:23,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:23,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:23,551 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-12-09 19:22:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:23,701 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-12-09 19:22:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:23,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 19:22:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:23,717 INFO L225 Difference]: With dead ends: 35468 [2018-12-09 19:22:23,717 INFO L226 Difference]: Without dead ends: 20362 [2018-12-09 19:22:23,730 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-09 19:22:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-12-09 19:22:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-12-09 19:22:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-12-09 19:22:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-12-09 19:22:23,953 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-12-09 19:22:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:23,953 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-12-09 19:22:23,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-12-09 19:22:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:22:23,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:23,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:23,960 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:23,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-12-09 19:22:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:23,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:23,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:23,981 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-09 19:22:23,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:23,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:23,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:23,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:23,982 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-12-09 19:22:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:24,113 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-12-09 19:22:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:24,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 19:22:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:24,130 INFO L225 Difference]: With dead ends: 30732 [2018-12-09 19:22:24,130 INFO L226 Difference]: Without dead ends: 20746 [2018-12-09 19:22:24,138 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-09 19:22:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-12-09 19:22:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-12-09 19:22:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-12-09 19:22:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-12-09 19:22:24,412 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-12-09 19:22:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:24,412 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-12-09 19:22:24,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-12-09 19:22:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:22:24,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:24,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:24,419 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:24,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-12-09 19:22:24,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:24,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:24,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:24,438 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-09 19:22:24,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:24,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:24,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:24,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:24,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:24,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:24,439 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-12-09 19:22:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:24,653 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-12-09 19:22:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:24,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 19:22:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:24,677 INFO L225 Difference]: With dead ends: 35852 [2018-12-09 19:22:24,678 INFO L226 Difference]: Without dead ends: 35850 [2018-12-09 19:22:24,683 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-09 19:22:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-12-09 19:22:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-12-09 19:22:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-12-09 19:22:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-12-09 19:22:25,078 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-12-09 19:22:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:25,079 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-12-09 19:22:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-12-09 19:22:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:22:25,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:25,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:25,089 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:25,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-12-09 19:22:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:25,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:25,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:25,104 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-09 19:22:25,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:25,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:25,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:25,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:25,104 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-12-09 19:22:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:25,382 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-12-09 19:22:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:25,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 19:22:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:25,410 INFO L225 Difference]: With dead ends: 70668 [2018-12-09 19:22:25,410 INFO L226 Difference]: Without dead ends: 40458 [2018-12-09 19:22:25,431 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-09 19:22:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-12-09 19:22:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-12-09 19:22:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-12-09 19:22:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-12-09 19:22:25,953 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-12-09 19:22:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:25,953 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-12-09 19:22:25,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-12-09 19:22:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:22:25,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:25,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:25,966 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:25,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-12-09 19:22:25,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:25,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:25,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:25,981 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-09 19:22:25,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:25,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:25,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:25,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:25,982 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-12-09 19:22:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:26,268 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-12-09 19:22:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:26,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 19:22:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:26,295 INFO L225 Difference]: With dead ends: 60684 [2018-12-09 19:22:26,296 INFO L226 Difference]: Without dead ends: 40970 [2018-12-09 19:22:26,309 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-09 19:22:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-12-09 19:22:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-12-09 19:22:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-12-09 19:22:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-12-09 19:22:26,771 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-12-09 19:22:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:26,771 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-12-09 19:22:26,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-12-09 19:22:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:22:26,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:26,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:26,785 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:26,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:26,785 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-12-09 19:22:26,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:26,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:26,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:26,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:26,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:26,806 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-09 19:22:26,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:26,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:26,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:26,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:26,808 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-12-09 19:22:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:27,418 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-12-09 19:22:27,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:27,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 19:22:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:27,465 INFO L225 Difference]: With dead ends: 69644 [2018-12-09 19:22:27,465 INFO L226 Difference]: Without dead ends: 69642 [2018-12-09 19:22:27,473 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-09 19:22:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-12-09 19:22:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-12-09 19:22:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-12-09 19:22:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-12-09 19:22:28,109 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-12-09 19:22:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:28,109 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-12-09 19:22:28,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-12-09 19:22:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:22:28,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:28,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:28,133 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:28,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-12-09 19:22:28,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:28,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:28,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:28,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:28,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:28,142 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-09 19:22:28,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:28,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:28,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:28,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:28,143 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-12-09 19:22:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:28,838 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-12-09 19:22:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:28,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 19:22:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:28,890 INFO L225 Difference]: With dead ends: 140300 [2018-12-09 19:22:28,890 INFO L226 Difference]: Without dead ends: 79882 [2018-12-09 19:22:28,920 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-09 19:22:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-12-09 19:22:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-12-09 19:22:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-12-09 19:22:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-12-09 19:22:29,864 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-12-09 19:22:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:29,865 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-12-09 19:22:29,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-12-09 19:22:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:22:29,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:29,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:29,900 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:29,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-12-09 19:22:29,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:29,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:29,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:29,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:29,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:22:29,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:29,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:29,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:29,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:29,914 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-12-09 19:22:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:30,613 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-12-09 19:22:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:30,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 19:22:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:30,668 INFO L225 Difference]: With dead ends: 119820 [2018-12-09 19:22:30,669 INFO L226 Difference]: Without dead ends: 80906 [2018-12-09 19:22:30,691 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-09 19:22:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-12-09 19:22:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-12-09 19:22:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-12-09 19:22:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-12-09 19:22:31,773 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-12-09 19:22:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:31,774 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-12-09 19:22:31,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-12-09 19:22:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:22:31,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:31,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:31,795 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:31,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-12-09 19:22:31,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:31,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:31,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:31,805 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-09 19:22:31,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:31,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:31,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:31,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:31,807 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-12-09 19:22:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:32,797 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-12-09 19:22:32,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:32,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 19:22:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:32,898 INFO L225 Difference]: With dead ends: 135180 [2018-12-09 19:22:32,898 INFO L226 Difference]: Without dead ends: 135178 [2018-12-09 19:22:32,925 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-09 19:22:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-12-09 19:22:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-12-09 19:22:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-12-09 19:22:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-12-09 19:22:34,414 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-12-09 19:22:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:34,414 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-12-09 19:22:34,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-12-09 19:22:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:22:34,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:34,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:34,466 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:34,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-12-09 19:22:34,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:34,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:34,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:34,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-09 19:22:34,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:34,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:34,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:34,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:34,480 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-12-09 19:22:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:35,822 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-12-09 19:22:35,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:35,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 19:22:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:35,946 INFO L225 Difference]: With dead ends: 278540 [2018-12-09 19:22:35,946 INFO L226 Difference]: Without dead ends: 157706 [2018-12-09 19:22:36,022 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-09 19:22:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-12-09 19:22:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-12-09 19:22:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-12-09 19:22:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-12-09 19:22:38,142 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-12-09 19:22:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:38,143 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-12-09 19:22:38,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-12-09 19:22:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:22:38,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:38,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:38,198 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:38,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-12-09 19:22:38,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:38,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:38,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:38,210 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-09 19:22:38,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:38,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:38,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:38,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:38,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:38,211 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-12-09 19:22:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:40,402 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-12-09 19:22:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:40,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 19:22:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:40,518 INFO L225 Difference]: With dead ends: 236556 [2018-12-09 19:22:40,518 INFO L226 Difference]: Without dead ends: 159754 [2018-12-09 19:22:40,564 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-09 19:22:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-12-09 19:22:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-12-09 19:22:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-12-09 19:22:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-12-09 19:22:42,525 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-12-09 19:22:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:42,525 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-12-09 19:22:42,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-12-09 19:22:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:22:42,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:42,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:42,579 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:42,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-12-09 19:22:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:42,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:42,592 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-09 19:22:42,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:42,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:42,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:42,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:42,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:42,593 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-12-09 19:22:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:44,922 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-12-09 19:22:44,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:44,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 19:22:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:45,123 INFO L225 Difference]: With dead ends: 262156 [2018-12-09 19:22:45,123 INFO L226 Difference]: Without dead ends: 262154 [2018-12-09 19:22:45,154 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-09 19:22:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-12-09 19:22:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-12-09 19:22:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-12-09 19:22:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-12-09 19:22:48,057 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-12-09 19:22:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:48,057 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-12-09 19:22:48,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-12-09 19:22:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:22:48,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:48,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:48,168 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:48,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-12-09 19:22:48,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:48,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:48,178 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-09 19:22:48,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:48,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:48,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:48,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:48,179 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-12-09 19:22:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:51,037 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-12-09 19:22:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:51,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 19:22:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:51,323 INFO L225 Difference]: With dead ends: 552972 [2018-12-09 19:22:51,323 INFO L226 Difference]: Without dead ends: 311306 [2018-12-09 19:22:51,479 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-09 19:22:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-12-09 19:22:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-12-09 19:22:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-12-09 19:22:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-12-09 19:22:58,034 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-12-09 19:22:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-12-09 19:22:58,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-12-09 19:22:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 19:22:58,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:58,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:58,149 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:58,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-12-09 19:22:58,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:58,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:58,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:58,159 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-09 19:22:58,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:58,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:58,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:58,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:58,161 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-12-09 19:23:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:00,935 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-12-09 19:23:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:23:00,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 19:23:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:01,229 INFO L225 Difference]: With dead ends: 466956 [2018-12-09 19:23:01,229 INFO L226 Difference]: Without dead ends: 315402 [2018-12-09 19:23:01,357 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-09 19:23:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-12-09 19:23:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-12-09 19:23:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-12-09 19:23:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-12-09 19:23:05,921 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-12-09 19:23:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:05,922 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-12-09 19:23:05,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:23:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-12-09 19:23:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 19:23:06,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:23:06,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:23:06,037 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:23:06,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:23:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-12-09 19:23:06,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:23:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:06,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:06,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:23:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:06,059 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-09 19:23:06,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:23:06,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:23:06,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:23:06,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:23:06,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:23:06,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:23:06,060 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-12-09 19:23:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:10,951 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-12-09 19:23:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:23:10,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 19:23:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:11,396 INFO L225 Difference]: With dead ends: 507914 [2018-12-09 19:23:11,397 INFO L226 Difference]: Without dead ends: 507912 [2018-12-09 19:23:11,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-09 19:23:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-12-09 19:23:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-12-09 19:23:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-12-09 19:23:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-12-09 19:23:18,644 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-12-09 19:23:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:18,644 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-12-09 19:23:18,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:23:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-12-09 19:23:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 19:23:18,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:23:18,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:23:18,874 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:23:18,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:23:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-12-09 19:23:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:23:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:18,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:23:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:18,897 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-09 19:23:18,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:23:18,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:23:18,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:23:18,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:23:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:23:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:23:18,898 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-12-09 19:23:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:25,391 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-12-09 19:23:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:23:25,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 19:23:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:25,392 INFO L225 Difference]: With dead ends: 1097736 [2018-12-09 19:23:25,392 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:23:25,717 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-09 19:23:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:23:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:23:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:23:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:23:25,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-09 19:23:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:25,718 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:23:25,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:23:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:23:25,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:23:25,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:23:25,767 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:23:25,767 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:23:25,767 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:23:25,767 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:23:25,768 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,768 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,769 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-09 19:23:25,770 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-12-09 19:23:25,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:23:25 BoogieIcfgContainer [2018-12-09 19:23:25,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:23:25,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:23:25,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:23:25,775 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:23:25,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:20" (3/4) ... [2018-12-09 19:23:25,777 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:23:25,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:23:25,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:23:25,786 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 19:23:25,786 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:23:25,786 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:23:25,823 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d6ebba27-c43d-4968-96b0-46d9e43c2f23/bin-2019/utaipan/witness.graphml [2018-12-09 19:23:25,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:23:25,823 INFO L168 Benchmark]: Toolchain (without parser) took 65488.00 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 956.0 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,824 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:23:25,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.52 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.41 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,825 INFO L168 Benchmark]: Boogie Preprocessor took 44.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,825 INFO L168 Benchmark]: RCFGBuilder took 211.18 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.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,825 INFO L168 Benchmark]: TraceAbstraction took 65008.52 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,825 INFO L168 Benchmark]: Witness Printer took 48.46 ms. Allocated memory is still 6.3 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 581.0 kB). Peak memory consumption was 581.0 kB. Max. memory is 11.5 GB. [2018-12-09 19:23:25,826 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.52 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 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 12.41 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 211.18 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.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65008.52 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 48.46 ms. Allocated memory is still 6.3 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 581.0 kB). Peak memory consumption was 581.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 64.9s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 30.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 32.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...