./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/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 56f043bec3037ec37b4a132611abd4a337934428 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:43:20,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:43:20,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:43:20,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:43:20,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:43:20,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:43:20,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:43:20,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:43:20,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:43:20,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:43:20,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:43:20,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:43:20,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:43:20,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:43:20,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:43:20,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:43:20,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:43:20,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:43:20,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:43:20,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:43:20,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:43:20,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:43:20,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:43:20,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:43:20,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:43:20,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:43:20,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:43:20,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:43:20,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:43:20,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:43:20,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:43:20,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:43:20,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:43:20,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:43:20,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:43:20,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:43:20,208 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:43:20,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:43:20,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:43:20,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:43:20,219 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:43:20,219 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:43:20,219 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:43:20,219 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:43:20,219 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:43:20,219 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:43:20,220 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:43:20,220 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:43:20,220 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:43:20,220 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:43:20,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:43:20,221 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:43:20,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:43:20,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:43:20,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:43:20,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:43:20,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:43:20,223 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:43:20,223 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:43:20,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:43:20,223 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:43:20,223 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_9af9da81-258d-4765-8afa-c1d9364a6dfc/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-23 12:43:20,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:43:20,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:43:20,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:43:20,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:43:20,259 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:43:20,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:43:20,301 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/data/38d5f0a95/6a7501cafd134ed3a175d1607f957d94/FLAG49922f93b [2018-11-23 12:43:20,615 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:43:20,616 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:43:20,622 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/data/38d5f0a95/6a7501cafd134ed3a175d1607f957d94/FLAG49922f93b [2018-11-23 12:43:20,631 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/data/38d5f0a95/6a7501cafd134ed3a175d1607f957d94 [2018-11-23 12:43:20,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:43:20,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:43:20,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:20,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:43:20,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:43:20,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4007e260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20, skipping insertion in model container [2018-11-23 12:43:20,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:43:20,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:43:20,794 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:20,796 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:43:20,815 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:20,826 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:43:20,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20 WrapperNode [2018-11-23 12:43:20,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:20,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:20,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:43:20,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:43:20,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:20,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:43:20,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:43:20,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:43:20,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... [2018-11-23 12:43:20,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:43:20,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:43:20,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:43:20,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:43:20,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/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-11-23 12:43:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:43:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:43:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:43:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:43:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:43:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:43:21,106 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:43:21,106 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:43:21,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:21 BoogieIcfgContainer [2018-11-23 12:43:21,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:43:21,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:43:21,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:43:21,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:43:21,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:43:20" (1/3) ... [2018-11-23 12:43:21,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ab08c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:43:21, skipping insertion in model container [2018-11-23 12:43:21,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:20" (2/3) ... [2018-11-23 12:43:21,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ab08c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:43:21, skipping insertion in model container [2018-11-23 12:43:21,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:21" (3/3) ... [2018-11-23 12:43:21,112 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:43:21,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:43:21,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:43:21,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:43:21,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:43:21,162 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:43:21,162 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:43:21,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:43:21,162 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:43:21,162 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:43:21,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:43:21,163 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:43:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 12:43:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:21,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,181 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-11-23 12:43:21,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,327 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-23 12:43:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,359 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-11-23 12:43:21,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,368 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:43:21,368 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:43:21,370 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-11-23 12:43:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:43:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-11-23 12:43:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:43:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-11-23 12:43:21,395 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-11-23 12:43:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,395 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-11-23 12:43:21,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-11-23 12:43:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:21,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-11-23 12:43:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,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-11-23 12:43:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,440 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-11-23 12:43:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,474 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-11-23 12:43:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,475 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:43:21,475 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:43:21,476 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-11-23 12:43:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:43:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 12:43:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:43:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-11-23 12:43:21,481 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-11-23 12:43:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,481 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-11-23 12:43:21,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-11-23 12:43:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:21,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-11-23 12:43:21,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,520 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-11-23 12:43:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,536 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-11-23 12:43:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,537 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:43:21,537 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:43:21,538 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-11-23 12:43:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:43:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-23 12:43:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:43:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-23 12:43:21,544 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-11-23 12:43:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,545 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-23 12:43:21,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-23 12:43:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:21,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,546 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-11-23 12:43:21,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,574 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-11-23 12:43:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,585 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-11-23 12:43:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,587 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:43:21,587 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:43:21,587 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-11-23 12:43:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:43:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-11-23 12:43:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:43:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-11-23 12:43:21,594 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-11-23 12:43:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,595 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-11-23 12:43:21,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-11-23 12:43:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:21,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-11-23 12:43:21,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,628 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-11-23 12:43:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,653 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-11-23 12:43:21,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,654 INFO L225 Difference]: With dead ends: 244 [2018-11-23 12:43:21,654 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:43:21,655 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-11-23 12:43:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:43:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-23 12:43:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:43:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-11-23 12:43:21,663 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-11-23 12:43:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,663 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-11-23 12:43:21,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-11-23 12:43:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:21,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-11-23 12:43:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,698 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-11-23 12:43:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,712 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-11-23 12:43:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,713 INFO L225 Difference]: With dead ends: 219 [2018-11-23 12:43:21,713 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:43:21,713 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-11-23 12:43:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:43:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-23 12:43:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 12:43:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-11-23 12:43:21,719 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-11-23 12:43:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,720 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-11-23 12:43:21,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-11-23 12:43:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:21,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,720 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-11-23 12:43:21,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,747 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-11-23 12:43:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,766 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-11-23 12:43:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,768 INFO L225 Difference]: With dead ends: 276 [2018-11-23 12:43:21,768 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 12:43:21,768 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-11-23 12:43:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 12:43:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-11-23 12:43:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 12:43:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-11-23 12:43:21,777 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-11-23 12:43:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,777 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-11-23 12:43:21,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-11-23 12:43:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:21,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:21,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-11-23 12:43:21,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,795 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-11-23 12:43:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,822 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-11-23 12:43:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,823 INFO L225 Difference]: With dead ends: 472 [2018-11-23 12:43:21,823 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 12:43:21,824 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-11-23 12:43:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 12:43:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-11-23 12:43:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-23 12:43:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-11-23 12:43:21,832 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-11-23 12:43:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,832 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-11-23 12:43:21,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-11-23 12:43:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:21,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,833 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-11-23 12:43:21,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-11-23 12:43:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,862 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-11-23 12:43:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,872 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-11-23 12:43:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,873 INFO L225 Difference]: With dead ends: 420 [2018-11-23 12:43:21,873 INFO L226 Difference]: Without dead ends: 286 [2018-11-23 12:43:21,874 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-11-23 12:43:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-23 12:43:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-23 12:43:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 12:43:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-11-23 12:43:21,881 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-11-23 12:43:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,882 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-11-23 12:43:21,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-11-23 12:43:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:21,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,883 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-11-23 12:43:21,883 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-11-23 12:43:21,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,913 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-11-23 12:43:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,947 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-11-23 12:43:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,949 INFO L225 Difference]: With dead ends: 524 [2018-11-23 12:43:21,949 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 12:43:21,949 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-11-23 12:43:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 12:43:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-11-23 12:43:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 12:43:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-11-23 12:43:21,961 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-11-23 12:43:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,962 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-11-23 12:43:21,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-11-23 12:43:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:21,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,964 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-11-23 12:43:21,964 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-11-23 12:43:21,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:21,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:21,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,987 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-11-23 12:43:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,009 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-11-23 12:43:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,010 INFO L225 Difference]: With dead ends: 924 [2018-11-23 12:43:22,011 INFO L226 Difference]: Without dead ends: 546 [2018-11-23 12:43:22,011 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-11-23 12:43:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-23 12:43:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-11-23 12:43:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-23 12:43:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-11-23 12:43:22,022 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-11-23 12:43:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,022 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-11-23 12:43:22,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-11-23 12:43:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:22,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,024 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-11-23 12:43:22,024 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-11-23 12:43:22,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,042 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-11-23 12:43:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,068 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-11-23 12:43:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,070 INFO L225 Difference]: With dead ends: 816 [2018-11-23 12:43:22,070 INFO L226 Difference]: Without dead ends: 554 [2018-11-23 12:43:22,071 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-11-23 12:43:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-23 12:43:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-11-23 12:43:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 12:43:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-11-23 12:43:22,082 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-11-23 12:43:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,082 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-11-23 12:43:22,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-11-23 12:43:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:22,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,083 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-11-23 12:43:22,083 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-11-23 12:43:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,118 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-11-23 12:43:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,138 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-11-23 12:43:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,140 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 12:43:22,141 INFO L226 Difference]: Without dead ends: 1002 [2018-11-23 12:43:22,141 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-11-23 12:43:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-23 12:43:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-11-23 12:43:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 12:43:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-11-23 12:43:22,156 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-11-23 12:43:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,157 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-11-23 12:43:22,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-11-23 12:43:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:22,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,158 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-11-23 12:43:22,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-11-23 12:43:22,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,182 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-11-23 12:43:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,205 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-11-23 12:43:22,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,208 INFO L225 Difference]: With dead ends: 1820 [2018-11-23 12:43:22,208 INFO L226 Difference]: Without dead ends: 1066 [2018-11-23 12:43:22,209 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-11-23 12:43:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-23 12:43:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-11-23 12:43:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-23 12:43:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-11-23 12:43:22,229 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-11-23 12:43:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,229 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-11-23 12:43:22,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-11-23 12:43:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:43:22,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,231 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-11-23 12:43:22,231 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,231 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-11-23 12:43:22,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,251 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-11-23 12:43:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,273 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-11-23 12:43:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,276 INFO L225 Difference]: With dead ends: 1596 [2018-11-23 12:43:22,276 INFO L226 Difference]: Without dead ends: 1082 [2018-11-23 12:43:22,277 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-11-23 12:43:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-11-23 12:43:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-11-23 12:43:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-11-23 12:43:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-11-23 12:43:22,299 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-11-23 12:43:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,299 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-11-23 12:43:22,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-11-23 12:43:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:43:22,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,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-11-23 12:43:22,301 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-11-23 12:43:22,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,322 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-11-23 12:43:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,351 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-11-23 12:43:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,355 INFO L225 Difference]: With dead ends: 1932 [2018-11-23 12:43:22,355 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 12:43:22,356 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-11-23 12:43:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 12:43:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-11-23 12:43:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 12:43:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-11-23 12:43:22,385 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-11-23 12:43:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,385 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-11-23 12:43:22,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-11-23 12:43:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:43:22,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,387 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-11-23 12:43:22,387 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-11-23 12:43:22,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,434 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-11-23 12:43:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,467 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-11-23 12:43:22,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,471 INFO L225 Difference]: With dead ends: 3596 [2018-11-23 12:43:22,471 INFO L226 Difference]: Without dead ends: 2090 [2018-11-23 12:43:22,472 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-11-23 12:43:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-11-23 12:43:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-11-23 12:43:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-23 12:43:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-11-23 12:43:22,506 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-11-23 12:43:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,506 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-11-23 12:43:22,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-11-23 12:43:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:43:22,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,508 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-11-23 12:43:22,508 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-11-23 12:43:22,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,525 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-11-23 12:43:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,562 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-11-23 12:43:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:43:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,566 INFO L225 Difference]: With dead ends: 3132 [2018-11-23 12:43:22,566 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 12:43:22,567 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-11-23 12:43:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 12:43:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-11-23 12:43:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-23 12:43:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-11-23 12:43:22,603 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-11-23 12:43:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,603 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-11-23 12:43:22,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-11-23 12:43:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:43:22,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,605 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-11-23 12:43:22,605 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-11-23 12:43:22,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,625 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-11-23 12:43:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,667 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-11-23 12:43:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:43:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,674 INFO L225 Difference]: With dead ends: 3724 [2018-11-23 12:43:22,674 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 12:43:22,675 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-11-23 12:43:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 12:43:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-11-23 12:43:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-11-23 12:43:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-11-23 12:43:22,724 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-11-23 12:43:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,724 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-11-23 12:43:22,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-11-23 12:43:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:43:22,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,726 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-11-23 12:43:22,727 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-11-23 12:43:22,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,750 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-11-23 12:43:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,810 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-11-23 12:43:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:43:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,817 INFO L225 Difference]: With dead ends: 7116 [2018-11-23 12:43:22,817 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 12:43:22,820 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-11-23 12:43:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 12:43:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-11-23 12:43:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 12:43:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-11-23 12:43:22,889 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-11-23 12:43:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,889 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-11-23 12:43:22,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-11-23 12:43:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:43:22,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,893 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-11-23 12:43:22,893 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-11-23 12:43:22,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:22,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:22,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,918 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-11-23 12:43:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,979 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-11-23 12:43:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:22,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:43:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:22,989 INFO L225 Difference]: With dead ends: 6156 [2018-11-23 12:43:22,989 INFO L226 Difference]: Without dead ends: 4170 [2018-11-23 12:43:22,992 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-11-23 12:43:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-23 12:43:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-11-23 12:43:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-11-23 12:43:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-11-23 12:43:23,113 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-11-23 12:43:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:23,114 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-11-23 12:43:23,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-11-23 12:43:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:43:23,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:23,118 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-11-23 12:43:23,118 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:23,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-11-23 12:43:23,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:23,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:23,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:23,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:23,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:23,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:23,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:23,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:23,135 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-11-23 12:43:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:23,258 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-11-23 12:43:23,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:23,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:43:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:23,272 INFO L225 Difference]: With dead ends: 12108 [2018-11-23 12:43:23,272 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 12:43:23,278 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-11-23 12:43:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 12:43:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-11-23 12:43:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 12:43:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-11-23 12:43:23,481 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-11-23 12:43:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:23,481 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-11-23 12:43:23,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-11-23 12:43:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:43:23,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:23,488 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-11-23 12:43:23,488 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:23,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-11-23 12:43:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:23,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:23,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:23,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:23,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:23,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:23,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:23,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:23,508 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-11-23 12:43:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:23,666 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-11-23 12:43:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:23,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:43:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:23,680 INFO L225 Difference]: With dead ends: 9100 [2018-11-23 12:43:23,680 INFO L226 Difference]: Without dead ends: 9098 [2018-11-23 12:43:23,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-11-23 12:43:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-11-23 12:43:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-11-23 12:43:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 12:43:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-11-23 12:43:23,894 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-11-23 12:43:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:23,895 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-11-23 12:43:23,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-11-23 12:43:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:43:23,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:23,903 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-11-23 12:43:23,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:23,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-11-23 12:43:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:23,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:23,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:23,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:23,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:23,969 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:23,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:23,970 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-11-23 12:43:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:24,173 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-11-23 12:43:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:24,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:43:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:24,192 INFO L225 Difference]: With dead ends: 13708 [2018-11-23 12:43:24,192 INFO L226 Difference]: Without dead ends: 13706 [2018-11-23 12:43:24,196 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-11-23 12:43:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-11-23 12:43:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-11-23 12:43:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-23 12:43:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-11-23 12:43:24,434 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-11-23 12:43:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:24,434 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-11-23 12:43:24,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-11-23 12:43:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:43:24,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:24,446 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-11-23 12:43:24,446 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:24,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-11-23 12:43:24,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:24,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:24,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:24,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:24,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:24,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:24,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:24,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:24,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:24,462 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-11-23 12:43:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:24,709 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-11-23 12:43:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:24,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:43:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:24,731 INFO L225 Difference]: With dead ends: 27788 [2018-11-23 12:43:24,731 INFO L226 Difference]: Without dead ends: 15754 [2018-11-23 12:43:24,747 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-11-23 12:43:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-11-23 12:43:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-11-23 12:43:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-11-23 12:43:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-11-23 12:43:25,138 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-11-23 12:43:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:25,138 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-11-23 12:43:25,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-11-23 12:43:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:25,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:25,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-11-23 12:43:25,151 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:25,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-11-23 12:43:25,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:25,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-11-23 12:43:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:25,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:25,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:25,167 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-11-23 12:43:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:25,385 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-11-23 12:43:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:25,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:25,408 INFO L225 Difference]: With dead ends: 23820 [2018-11-23 12:43:25,408 INFO L226 Difference]: Without dead ends: 16138 [2018-11-23 12:43:25,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-11-23 12:43:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-11-23 12:43:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-11-23 12:43:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-11-23 12:43:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-11-23 12:43:25,793 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-11-23 12:43:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:25,793 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-11-23 12:43:25,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-11-23 12:43:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:25,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:25,806 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-11-23 12:43:25,806 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:25,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-11-23 12:43:25,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:25,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:25,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:25,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:25,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:25,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:25,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:25,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:25,830 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-11-23 12:43:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:26,093 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-11-23 12:43:26,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:26,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:26,126 INFO L225 Difference]: With dead ends: 26636 [2018-11-23 12:43:26,126 INFO L226 Difference]: Without dead ends: 26634 [2018-11-23 12:43:26,133 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-11-23 12:43:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-11-23 12:43:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-11-23 12:43:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-11-23 12:43:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-11-23 12:43:26,424 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-11-23 12:43:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:26,424 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-11-23 12:43:26,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-11-23 12:43:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:26,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:26,436 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-11-23 12:43:26,436 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:26,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-11-23 12:43:26,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:26,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:26,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:26,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:26,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:26,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:26,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:26,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:26,467 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-11-23 12:43:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:26,807 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-11-23 12:43:26,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:26,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:26,825 INFO L225 Difference]: With dead ends: 55308 [2018-11-23 12:43:26,825 INFO L226 Difference]: Without dead ends: 31242 [2018-11-23 12:43:26,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-11-23 12:43:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-11-23 12:43:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-11-23 12:43:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-11-23 12:43:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-11-23 12:43:27,221 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-11-23 12:43:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:27,221 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-11-23 12:43:27,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-11-23 12:43:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:27,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:27,235 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-11-23 12:43:27,235 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:27,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-11-23 12:43:27,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:27,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:27,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:27,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:27,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:27,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:27,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:27,270 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-11-23 12:43:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:27,648 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-11-23 12:43:27,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:27,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:27,664 INFO L225 Difference]: With dead ends: 46860 [2018-11-23 12:43:27,664 INFO L226 Difference]: Without dead ends: 31754 [2018-11-23 12:43:27,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-11-23 12:43:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-11-23 12:43:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-11-23 12:43:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-11-23 12:43:28,051 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-11-23 12:43:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:28,051 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-11-23 12:43:28,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-11-23 12:43:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:28,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:28,060 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-11-23 12:43:28,060 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:28,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-11-23 12:43:28,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:28,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:28,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:28,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:28,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:28,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:28,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:28,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:28,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:28,098 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-11-23 12:43:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:28,607 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-11-23 12:43:28,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:28,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:28,633 INFO L225 Difference]: With dead ends: 51210 [2018-11-23 12:43:28,633 INFO L226 Difference]: Without dead ends: 51208 [2018-11-23 12:43:28,638 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-11-23 12:43:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-11-23 12:43:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-11-23 12:43:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-11-23 12:43:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-11-23 12:43:29,134 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-11-23 12:43:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:29,134 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-11-23 12:43:29,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-11-23 12:43:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:29,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:29,155 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-11-23 12:43:29,155 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:29,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-11-23 12:43:29,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:43:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:29,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:29,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:43:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:29,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:29,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:29,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:43:29,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:29,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:29,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:29,190 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-11-23 12:43:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:29,915 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-11-23 12:43:29,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:29,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:29,915 INFO L225 Difference]: With dead ends: 109576 [2018-11-23 12:43:29,915 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:43:29,961 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-11-23 12:43:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:43:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:43:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:43:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:43:29,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 12:43:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:29,962 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:29,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:29,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:29,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:43:29,997 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:43:29,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:29,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:29,997 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:43:29,997 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:43:29,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,998 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:29,999 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,000 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,000 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-23 12:43:30,001 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-23 12:43:30,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:43:30 BoogieIcfgContainer [2018-11-23 12:43:30,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:43:30,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:43:30,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:43:30,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:43:30,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:21" (3/4) ... [2018-11-23 12:43:30,015 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:43:30,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:43:30,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:43:30,024 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:43:30,024 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:43:30,025 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:43:30,066 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9af9da81-258d-4765-8afa-c1d9364a6dfc/bin-2019/utaipan/witness.graphml [2018-11-23 12:43:30,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:43:30,067 INFO L168 Benchmark]: Toolchain (without parser) took 9432.95 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 879.8 MB). Free memory was 960.9 MB in the beginning and 1.4 GB in the end (delta: -406.7 MB). Peak memory consumption was 473.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:30,068 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:30,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.37 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:30,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.53 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:30,069 INFO L168 Benchmark]: Boogie Preprocessor took 50.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:30,069 INFO L168 Benchmark]: RCFGBuilder took 215.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:30,069 INFO L168 Benchmark]: TraceAbstraction took 8903.55 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 744.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -257.2 MB). Peak memory consumption was 487.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:30,069 INFO L168 Benchmark]: Witness Printer took 55.33 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:30,071 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.37 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.53 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 215.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8903.55 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 744.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -257.2 MB). Peak memory consumption was 487.3 MB. Max. memory is 11.5 GB. * Witness Printer took 55.33 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, 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: 3.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 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.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...