./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:08:36,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:08:36,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:08:36,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:08:36,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:08:36,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:08:36,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:08:36,278 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:08:36,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:08:36,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:08:36,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:08:36,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:08:36,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:08:36,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:08:36,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:08:36,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:08:36,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:08:36,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:08:36,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:08:36,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:08:36,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:08:36,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:08:36,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:08:36,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:08:36,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:08:36,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:08:36,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:08:36,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:08:36,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:08:36,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:08:36,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:08:36,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:08:36,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:08:36,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:08:36,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:08:36,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:08:36,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:08:36,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:08:36,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:08:36,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:08:36,302 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:08:36,302 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:08:36,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:08:36,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:08:36,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:08:36,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:08:36,303 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:08:36,303 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:08:36,303 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:08:36,304 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:08:36,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:08:36,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:08:36,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:08:36,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:08:36,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:08:36,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:08:36,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:08:36,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:08:36,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:08:36,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:08:36,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:08:36,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:08:36,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:08:36,307 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:08:36,307 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:08:36,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:08:36,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:08:36,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:08:36,308 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_68071188-9879-430c-818c-77d3e79b4263/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-18 16:08:36,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:08:36,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:08:36,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:08:36,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:08:36,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:08:36,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:08:36,387 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/data/0fd873d25/1cb5a0ecc01a41cf857500a516bc7812/FLAGd0edb6aa1 [2018-11-18 16:08:36,797 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:08:36,798 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:08:36,803 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/data/0fd873d25/1cb5a0ecc01a41cf857500a516bc7812/FLAGd0edb6aa1 [2018-11-18 16:08:36,814 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/data/0fd873d25/1cb5a0ecc01a41cf857500a516bc7812 [2018-11-18 16:08:36,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:08:36,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:08:36,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:08:36,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:08:36,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:08:36,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:08:36" (1/1) ... [2018-11-18 16:08:36,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411459c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:36, skipping insertion in model container [2018-11-18 16:08:36,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:08:36" (1/1) ... [2018-11-18 16:08:36,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:08:36,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:08:36,974 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:08:36,977 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:08:36,995 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:08:37,003 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:08:37,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37 WrapperNode [2018-11-18 16:08:37,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:08:37,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:08:37,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:08:37,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:08:37,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:08:37,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:08:37,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:08:37,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:08:37,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... [2018-11-18 16:08:37,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:08:37,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:08:37,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:08:37,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:08:37,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/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-18 16:08:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:08:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:08:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:08:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:08:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:08:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:08:37,325 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:08:37,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:08:37 BoogieIcfgContainer [2018-11-18 16:08:37,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:08:37,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:08:37,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:08:37,328 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:08:37,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:08:36" (1/3) ... [2018-11-18 16:08:37,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740efc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:08:37, skipping insertion in model container [2018-11-18 16:08:37,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:37" (2/3) ... [2018-11-18 16:08:37,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740efc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:08:37, skipping insertion in model container [2018-11-18 16:08:37,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:08:37" (3/3) ... [2018-11-18 16:08:37,330 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:08:37,335 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:08:37,340 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:08:37,349 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:08:37,368 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:08:37,368 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:08:37,368 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:08:37,368 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:08:37,368 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:08:37,369 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:08:37,369 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:08:37,369 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:08:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-18 16:08:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:08:37,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,386 INFO L375 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-18 16:08:37,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash -26794943, now seen corresponding path program 1 times [2018-11-18 16:08:37,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:37,522 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-18 16:08:37,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:37,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:37,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:37,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:37,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:37,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:37,541 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-11-18 16:08:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:37,585 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2018-11-18 16:08:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:37,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:08:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:37,596 INFO L225 Difference]: With dead ends: 119 [2018-11-18 16:08:37,596 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 16:08:37,599 INFO L604 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-18 16:08:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 16:08:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2018-11-18 16:08:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 16:08:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2018-11-18 16:08:37,630 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2018-11-18 16:08:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:37,630 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2018-11-18 16:08:37,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2018-11-18 16:08:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:08:37,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,631 INFO L375 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-18 16:08:37,631 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2020939649, now seen corresponding path program 1 times [2018-11-18 16:08:37,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:37,680 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-18 16:08:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:37,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:37,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:37,682 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand 3 states. [2018-11-18 16:08:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:37,711 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2018-11-18 16:08:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:37,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:08:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:37,712 INFO L225 Difference]: With dead ends: 170 [2018-11-18 16:08:37,712 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 16:08:37,713 INFO L604 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-18 16:08:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 16:08:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-18 16:08:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 16:08:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 187 transitions. [2018-11-18 16:08:37,719 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 187 transitions. Word has length 26 [2018-11-18 16:08:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:37,719 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 187 transitions. [2018-11-18 16:08:37,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2018-11-18 16:08:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:08:37,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,720 INFO L375 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-18 16:08:37,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -830431472, now seen corresponding path program 1 times [2018-11-18 16:08:37,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:37,753 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-18 16:08:37,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:37,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:37,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:37,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:37,754 INFO L87 Difference]: Start difference. First operand 102 states and 187 transitions. Second operand 3 states. [2018-11-18 16:08:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:37,778 INFO L93 Difference]: Finished difference Result 157 states and 283 transitions. [2018-11-18 16:08:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:37,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 16:08:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:37,780 INFO L225 Difference]: With dead ends: 157 [2018-11-18 16:08:37,780 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 16:08:37,780 INFO L604 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-18 16:08:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 16:08:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-18 16:08:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 16:08:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 190 transitions. [2018-11-18 16:08:37,788 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 190 transitions. Word has length 27 [2018-11-18 16:08:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:37,788 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 190 transitions. [2018-11-18 16:08:37,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 190 transitions. [2018-11-18 16:08:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:08:37,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,789 INFO L375 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-18 16:08:37,790 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1775592082, now seen corresponding path program 1 times [2018-11-18 16:08:37,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:37,827 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-18 16:08:37,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:37,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:37,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:37,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:37,828 INFO L87 Difference]: Start difference. First operand 106 states and 190 transitions. Second operand 3 states. [2018-11-18 16:08:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:37,850 INFO L93 Difference]: Finished difference Result 201 states and 365 transitions. [2018-11-18 16:08:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:37,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 16:08:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:37,851 INFO L225 Difference]: With dead ends: 201 [2018-11-18 16:08:37,851 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 16:08:37,851 INFO L604 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-18 16:08:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 16:08:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 139. [2018-11-18 16:08:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 16:08:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 251 transitions. [2018-11-18 16:08:37,858 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 251 transitions. Word has length 27 [2018-11-18 16:08:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:37,859 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 251 transitions. [2018-11-18 16:08:37,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 251 transitions. [2018-11-18 16:08:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:08:37,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,860 INFO L375 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-18 16:08:37,860 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -218552624, now seen corresponding path program 1 times [2018-11-18 16:08:37,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:37,887 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-18 16:08:37,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:37,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:37,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:37,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:37,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:37,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:37,888 INFO L87 Difference]: Start difference. First operand 139 states and 251 transitions. Second operand 3 states. [2018-11-18 16:08:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:37,906 INFO L93 Difference]: Finished difference Result 331 states and 605 transitions. [2018-11-18 16:08:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:37,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 16:08:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:37,907 INFO L225 Difference]: With dead ends: 331 [2018-11-18 16:08:37,907 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 16:08:37,908 INFO L604 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-18 16:08:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 16:08:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-18 16:08:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-18 16:08:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 359 transitions. [2018-11-18 16:08:37,915 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 359 transitions. Word has length 27 [2018-11-18 16:08:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:37,915 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 359 transitions. [2018-11-18 16:08:37,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 359 transitions. [2018-11-18 16:08:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:08:37,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,916 INFO L375 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-18 16:08:37,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash -791008204, now seen corresponding path program 1 times [2018-11-18 16:08:37,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:37,959 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-18 16:08:37,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:37,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:37,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:37,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:37,960 INFO L87 Difference]: Start difference. First operand 199 states and 359 transitions. Second operand 3 states. [2018-11-18 16:08:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:37,969 INFO L93 Difference]: Finished difference Result 298 states and 536 transitions. [2018-11-18 16:08:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:37,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:08:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:37,971 INFO L225 Difference]: With dead ends: 298 [2018-11-18 16:08:37,971 INFO L226 Difference]: Without dead ends: 203 [2018-11-18 16:08:37,971 INFO L604 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-18 16:08:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-18 16:08:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-18 16:08:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:08:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 359 transitions. [2018-11-18 16:08:37,980 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 359 transitions. Word has length 28 [2018-11-18 16:08:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:37,980 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 359 transitions. [2018-11-18 16:08:37,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 359 transitions. [2018-11-18 16:08:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:08:37,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:37,982 INFO L375 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-18 16:08:37,982 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:37,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1815015350, now seen corresponding path program 1 times [2018-11-18 16:08:37,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:37,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,010 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-18 16:08:38,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,011 INFO L87 Difference]: Start difference. First operand 201 states and 359 transitions. Second operand 3 states. [2018-11-18 16:08:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,030 INFO L93 Difference]: Finished difference Result 381 states and 689 transitions. [2018-11-18 16:08:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:08:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,031 INFO L225 Difference]: With dead ends: 381 [2018-11-18 16:08:38,031 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 16:08:38,032 INFO L604 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-18 16:08:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 16:08:38,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 269. [2018-11-18 16:08:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 16:08:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 479 transitions. [2018-11-18 16:08:38,041 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 479 transitions. Word has length 28 [2018-11-18 16:08:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,041 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 479 transitions. [2018-11-18 16:08:38,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 479 transitions. [2018-11-18 16:08:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:08:38,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,043 INFO L375 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-18 16:08:38,043 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash -179129356, now seen corresponding path program 1 times [2018-11-18 16:08:38,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,078 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-18 16:08:38,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,079 INFO L87 Difference]: Start difference. First operand 269 states and 479 transitions. Second operand 3 states. [2018-11-18 16:08:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,100 INFO L93 Difference]: Finished difference Result 645 states and 1157 transitions. [2018-11-18 16:08:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:08:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,102 INFO L225 Difference]: With dead ends: 645 [2018-11-18 16:08:38,102 INFO L226 Difference]: Without dead ends: 387 [2018-11-18 16:08:38,103 INFO L604 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-18 16:08:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-18 16:08:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-11-18 16:08:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-18 16:08:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 683 transitions. [2018-11-18 16:08:38,113 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 683 transitions. Word has length 28 [2018-11-18 16:08:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,114 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 683 transitions. [2018-11-18 16:08:38,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 683 transitions. [2018-11-18 16:08:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:08:38,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,115 INFO L375 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-18 16:08:38,115 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash 431113445, now seen corresponding path program 1 times [2018-11-18 16:08:38,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,136 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-18 16:08:38,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,137 INFO L87 Difference]: Start difference. First operand 385 states and 683 transitions. Second operand 3 states. [2018-11-18 16:08:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,166 INFO L93 Difference]: Finished difference Result 577 states and 1021 transitions. [2018-11-18 16:08:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 16:08:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,168 INFO L225 Difference]: With dead ends: 577 [2018-11-18 16:08:38,168 INFO L226 Difference]: Without dead ends: 391 [2018-11-18 16:08:38,169 INFO L604 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-18 16:08:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-18 16:08:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-11-18 16:08:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-18 16:08:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 683 transitions. [2018-11-18 16:08:38,177 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 683 transitions. Word has length 29 [2018-11-18 16:08:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,177 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 683 transitions. [2018-11-18 16:08:38,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 683 transitions. [2018-11-18 16:08:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:08:38,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,179 INFO L375 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-18 16:08:38,179 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1257830297, now seen corresponding path program 1 times [2018-11-18 16:08:38,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,198 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-18 16:08:38,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,199 INFO L87 Difference]: Start difference. First operand 389 states and 683 transitions. Second operand 3 states. [2018-11-18 16:08:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,222 INFO L93 Difference]: Finished difference Result 733 states and 1305 transitions. [2018-11-18 16:08:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 16:08:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,224 INFO L225 Difference]: With dead ends: 733 [2018-11-18 16:08:38,224 INFO L226 Difference]: Without dead ends: 731 [2018-11-18 16:08:38,230 INFO L604 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-18 16:08:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-18 16:08:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 529. [2018-11-18 16:08:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-18 16:08:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 919 transitions. [2018-11-18 16:08:38,241 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 919 transitions. Word has length 29 [2018-11-18 16:08:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,241 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 919 transitions. [2018-11-18 16:08:38,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 919 transitions. [2018-11-18 16:08:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:08:38,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,242 INFO L375 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-18 16:08:38,242 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1042992293, now seen corresponding path program 1 times [2018-11-18 16:08:38,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,260 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-18 16:08:38,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,261 INFO L87 Difference]: Start difference. First operand 529 states and 919 transitions. Second operand 3 states. [2018-11-18 16:08:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,279 INFO L93 Difference]: Finished difference Result 1269 states and 2217 transitions. [2018-11-18 16:08:38,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 16:08:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,282 INFO L225 Difference]: With dead ends: 1269 [2018-11-18 16:08:38,282 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 16:08:38,283 INFO L604 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-18 16:08:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 16:08:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-11-18 16:08:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-18 16:08:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1303 transitions. [2018-11-18 16:08:38,298 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1303 transitions. Word has length 29 [2018-11-18 16:08:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,299 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1303 transitions. [2018-11-18 16:08:38,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1303 transitions. [2018-11-18 16:08:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:08:38,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,300 INFO L375 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-18 16:08:38,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -337820759, now seen corresponding path program 1 times [2018-11-18 16:08:38,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,327 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-18 16:08:38,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,328 INFO L87 Difference]: Start difference. First operand 753 states and 1303 transitions. Second operand 3 states. [2018-11-18 16:08:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,346 INFO L93 Difference]: Finished difference Result 1129 states and 1949 transitions. [2018-11-18 16:08:38,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 16:08:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,348 INFO L225 Difference]: With dead ends: 1129 [2018-11-18 16:08:38,348 INFO L226 Difference]: Without dead ends: 763 [2018-11-18 16:08:38,349 INFO L604 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-18 16:08:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-18 16:08:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2018-11-18 16:08:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-18 16:08:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1303 transitions. [2018-11-18 16:08:38,362 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1303 transitions. Word has length 30 [2018-11-18 16:08:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1303 transitions. [2018-11-18 16:08:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1303 transitions. [2018-11-18 16:08:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:08:38,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,363 INFO L375 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-18 16:08:38,364 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764501, now seen corresponding path program 1 times [2018-11-18 16:08:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:38,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,385 INFO L87 Difference]: Start difference. First operand 761 states and 1303 transitions. Second operand 3 states. [2018-11-18 16:08:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,414 INFO L93 Difference]: Finished difference Result 2221 states and 3801 transitions. [2018-11-18 16:08:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 16:08:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,418 INFO L225 Difference]: With dead ends: 2221 [2018-11-18 16:08:38,418 INFO L226 Difference]: Without dead ends: 1483 [2018-11-18 16:08:38,419 INFO L604 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-18 16:08:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-18 16:08:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1481. [2018-11-18 16:08:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-18 16:08:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2503 transitions. [2018-11-18 16:08:38,445 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2503 transitions. Word has length 30 [2018-11-18 16:08:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,445 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2503 transitions. [2018-11-18 16:08:38,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2503 transitions. [2018-11-18 16:08:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:08:38,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,447 INFO L375 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-18 16:08:38,447 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -32619795, now seen corresponding path program 1 times [2018-11-18 16:08:38,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,470 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-18 16:08:38,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,472 INFO L87 Difference]: Start difference. First operand 1481 states and 2503 transitions. Second operand 3 states. [2018-11-18 16:08:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,507 INFO L93 Difference]: Finished difference Result 1853 states and 3193 transitions. [2018-11-18 16:08:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 16:08:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,511 INFO L225 Difference]: With dead ends: 1853 [2018-11-18 16:08:38,511 INFO L226 Difference]: Without dead ends: 1851 [2018-11-18 16:08:38,512 INFO L604 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-18 16:08:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-11-18 16:08:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1481. [2018-11-18 16:08:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-18 16:08:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2487 transitions. [2018-11-18 16:08:38,537 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2487 transitions. Word has length 30 [2018-11-18 16:08:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,537 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2487 transitions. [2018-11-18 16:08:38,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2487 transitions. [2018-11-18 16:08:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 16:08:38,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,539 INFO L375 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-18 16:08:38,539 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1595023034, now seen corresponding path program 1 times [2018-11-18 16:08:38,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,564 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-18 16:08:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,565 INFO L87 Difference]: Start difference. First operand 1481 states and 2487 transitions. Second operand 3 states. [2018-11-18 16:08:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,614 INFO L93 Difference]: Finished difference Result 2749 states and 4697 transitions. [2018-11-18 16:08:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 16:08:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,619 INFO L225 Difference]: With dead ends: 2749 [2018-11-18 16:08:38,619 INFO L226 Difference]: Without dead ends: 2747 [2018-11-18 16:08:38,619 INFO L604 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-18 16:08:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-11-18 16:08:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2073. [2018-11-18 16:08:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-11-18 16:08:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3415 transitions. [2018-11-18 16:08:38,650 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3415 transitions. Word has length 31 [2018-11-18 16:08:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,650 INFO L480 AbstractCegarLoop]: Abstraction has 2073 states and 3415 transitions. [2018-11-18 16:08:38,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3415 transitions. [2018-11-18 16:08:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 16:08:38,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,652 INFO L375 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-18 16:08:38,652 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -399121672, now seen corresponding path program 1 times [2018-11-18 16:08:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,670 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-18 16:08:38,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,671 INFO L87 Difference]: Start difference. First operand 2073 states and 3415 transitions. Second operand 3 states. [2018-11-18 16:08:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,710 INFO L93 Difference]: Finished difference Result 4957 states and 8217 transitions. [2018-11-18 16:08:38,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 16:08:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,715 INFO L225 Difference]: With dead ends: 4957 [2018-11-18 16:08:38,715 INFO L226 Difference]: Without dead ends: 2907 [2018-11-18 16:08:38,718 INFO L604 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-18 16:08:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-18 16:08:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2905. [2018-11-18 16:08:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2018-11-18 16:08:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4775 transitions. [2018-11-18 16:08:38,759 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4775 transitions. Word has length 31 [2018-11-18 16:08:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,760 INFO L480 AbstractCegarLoop]: Abstraction has 2905 states and 4775 transitions. [2018-11-18 16:08:38,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4775 transitions. [2018-11-18 16:08:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 16:08:38,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:38,762 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2093680032, now seen corresponding path program 1 times [2018-11-18 16:08:38,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,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-18 16:08:38,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,795 INFO L87 Difference]: Start difference. First operand 2905 states and 4775 transitions. Second operand 3 states. [2018-11-18 16:08:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,828 INFO L93 Difference]: Finished difference Result 4381 states and 7193 transitions. [2018-11-18 16:08:38,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 16:08:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,833 INFO L225 Difference]: With dead ends: 4381 [2018-11-18 16:08:38,833 INFO L226 Difference]: Without dead ends: 2955 [2018-11-18 16:08:38,835 INFO L604 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-18 16:08:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2018-11-18 16:08:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2018-11-18 16:08:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-11-18 16:08:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4807 transitions. [2018-11-18 16:08:38,878 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4807 transitions. Word has length 32 [2018-11-18 16:08:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:38,878 INFO L480 AbstractCegarLoop]: Abstraction has 2953 states and 4807 transitions. [2018-11-18 16:08:38,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4807 transitions. [2018-11-18 16:08:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 16:08:38,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:38,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:38,880 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:38,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 512343522, now seen corresponding path program 1 times [2018-11-18 16:08:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:38,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:38,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:38,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:38,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:38,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:38,907 INFO L87 Difference]: Start difference. First operand 2953 states and 4807 transitions. Second operand 3 states. [2018-11-18 16:08:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:38,954 INFO L93 Difference]: Finished difference Result 5389 states and 8937 transitions. [2018-11-18 16:08:38,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:38,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 16:08:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:38,963 INFO L225 Difference]: With dead ends: 5389 [2018-11-18 16:08:38,963 INFO L226 Difference]: Without dead ends: 5387 [2018-11-18 16:08:38,965 INFO L604 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-18 16:08:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-18 16:08:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 4169. [2018-11-18 16:08:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2018-11-18 16:08:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 6631 transitions. [2018-11-18 16:08:39,023 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 6631 transitions. Word has length 32 [2018-11-18 16:08:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:39,024 INFO L480 AbstractCegarLoop]: Abstraction has 4169 states and 6631 transitions. [2018-11-18 16:08:39,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 6631 transitions. [2018-11-18 16:08:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 16:08:39,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:39,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:39,027 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:39,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1481801184, now seen corresponding path program 1 times [2018-11-18 16:08:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:39,042 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-18 16:08:39,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:39,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:39,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:39,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:39,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:39,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:39,043 INFO L87 Difference]: Start difference. First operand 4169 states and 6631 transitions. Second operand 3 states. [2018-11-18 16:08:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:39,103 INFO L93 Difference]: Finished difference Result 9869 states and 15785 transitions. [2018-11-18 16:08:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:39,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 16:08:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:39,118 INFO L225 Difference]: With dead ends: 9869 [2018-11-18 16:08:39,119 INFO L226 Difference]: Without dead ends: 5771 [2018-11-18 16:08:39,123 INFO L604 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-18 16:08:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2018-11-18 16:08:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5769. [2018-11-18 16:08:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-18 16:08:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 9159 transitions. [2018-11-18 16:08:39,229 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 9159 transitions. Word has length 32 [2018-11-18 16:08:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:39,230 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 9159 transitions. [2018-11-18 16:08:39,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 9159 transitions. [2018-11-18 16:08:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 16:08:39,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:39,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:39,233 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:39,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1297006195, now seen corresponding path program 1 times [2018-11-18 16:08:39,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:39,247 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-18 16:08:39,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:39,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:39,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:39,248 INFO L87 Difference]: Start difference. First operand 5769 states and 9159 transitions. Second operand 3 states. [2018-11-18 16:08:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:39,304 INFO L93 Difference]: Finished difference Result 8653 states and 13705 transitions. [2018-11-18 16:08:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:39,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 16:08:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:39,313 INFO L225 Difference]: With dead ends: 8653 [2018-11-18 16:08:39,314 INFO L226 Difference]: Without dead ends: 5835 [2018-11-18 16:08:39,317 INFO L604 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-18 16:08:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2018-11-18 16:08:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5833. [2018-11-18 16:08:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5833 states. [2018-11-18 16:08:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 9159 transitions. [2018-11-18 16:08:39,398 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 9159 transitions. Word has length 33 [2018-11-18 16:08:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:39,398 INFO L480 AbstractCegarLoop]: Abstraction has 5833 states and 9159 transitions. [2018-11-18 16:08:39,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 9159 transitions. [2018-11-18 16:08:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 16:08:39,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:39,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:39,402 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:39,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:39,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1309017359, now seen corresponding path program 1 times [2018-11-18 16:08:39,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:39,418 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-18 16:08:39,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:39,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:39,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:39,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:39,419 INFO L87 Difference]: Start difference. First operand 5833 states and 9159 transitions. Second operand 3 states. [2018-11-18 16:08:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:39,498 INFO L93 Difference]: Finished difference Result 10509 states and 16841 transitions. [2018-11-18 16:08:39,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:39,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 16:08:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:39,508 INFO L225 Difference]: With dead ends: 10509 [2018-11-18 16:08:39,509 INFO L226 Difference]: Without dead ends: 10507 [2018-11-18 16:08:39,512 INFO L604 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-18 16:08:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-11-18 16:08:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 8329. [2018-11-18 16:08:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-18 16:08:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 12743 transitions. [2018-11-18 16:08:39,622 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 12743 transitions. Word has length 33 [2018-11-18 16:08:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:39,622 INFO L480 AbstractCegarLoop]: Abstraction has 8329 states and 12743 transitions. [2018-11-18 16:08:39,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 12743 transitions. [2018-11-18 16:08:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 16:08:39,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:39,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:39,628 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:39,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:39,628 INFO L82 PathProgramCache]: Analyzing trace with hash -685127347, now seen corresponding path program 1 times [2018-11-18 16:08:39,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:39,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:39,650 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-18 16:08:39,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:39,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:39,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:39,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:39,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:39,651 INFO L87 Difference]: Start difference. First operand 8329 states and 12743 transitions. Second operand 3 states. [2018-11-18 16:08:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:39,758 INFO L93 Difference]: Finished difference Result 19597 states and 30153 transitions. [2018-11-18 16:08:39,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:39,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 16:08:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:39,770 INFO L225 Difference]: With dead ends: 19597 [2018-11-18 16:08:39,770 INFO L226 Difference]: Without dead ends: 11403 [2018-11-18 16:08:39,778 INFO L604 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-18 16:08:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11403 states. [2018-11-18 16:08:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11403 to 11401. [2018-11-18 16:08:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2018-11-18 16:08:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 17415 transitions. [2018-11-18 16:08:40,023 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 17415 transitions. Word has length 33 [2018-11-18 16:08:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:40,023 INFO L480 AbstractCegarLoop]: Abstraction has 11401 states and 17415 transitions. [2018-11-18 16:08:40,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 17415 transitions. [2018-11-18 16:08:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 16:08:40,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:40,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:40,032 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:40,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:40,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1925046613, now seen corresponding path program 1 times [2018-11-18 16:08:40,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:40,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:40,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:40,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:40,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:40,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:40,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:40,058 INFO L87 Difference]: Start difference. First operand 11401 states and 17415 transitions. Second operand 3 states. [2018-11-18 16:08:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:40,197 INFO L93 Difference]: Finished difference Result 17101 states and 26057 transitions. [2018-11-18 16:08:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:40,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 16:08:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:40,214 INFO L225 Difference]: With dead ends: 17101 [2018-11-18 16:08:40,214 INFO L226 Difference]: Without dead ends: 11531 [2018-11-18 16:08:40,224 INFO L604 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-18 16:08:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11531 states. [2018-11-18 16:08:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11531 to 11529. [2018-11-18 16:08:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-18 16:08:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17415 transitions. [2018-11-18 16:08:40,448 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17415 transitions. Word has length 34 [2018-11-18 16:08:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:40,448 INFO L480 AbstractCegarLoop]: Abstraction has 11529 states and 17415 transitions. [2018-11-18 16:08:40,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17415 transitions. [2018-11-18 16:08:40,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 16:08:40,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:40,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:40,457 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:40,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:40,457 INFO L82 PathProgramCache]: Analyzing trace with hash 236102871, now seen corresponding path program 1 times [2018-11-18 16:08:40,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:40,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:40,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:40,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:40,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:40,475 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-18 16:08:40,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:40,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:40,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:40,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:40,476 INFO L87 Difference]: Start difference. First operand 11529 states and 17415 transitions. Second operand 3 states. [2018-11-18 16:08:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:40,712 INFO L93 Difference]: Finished difference Result 20493 states and 31625 transitions. [2018-11-18 16:08:40,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:40,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 16:08:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:40,739 INFO L225 Difference]: With dead ends: 20493 [2018-11-18 16:08:40,739 INFO L226 Difference]: Without dead ends: 20491 [2018-11-18 16:08:40,743 INFO L604 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-18 16:08:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2018-11-18 16:08:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 16649. [2018-11-18 16:08:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-18 16:08:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 24455 transitions. [2018-11-18 16:08:41,012 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 24455 transitions. Word has length 34 [2018-11-18 16:08:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:41,012 INFO L480 AbstractCegarLoop]: Abstraction has 16649 states and 24455 transitions. [2018-11-18 16:08:41,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 24455 transitions. [2018-11-18 16:08:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 16:08:41,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:41,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:41,028 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:41,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1758041835, now seen corresponding path program 1 times [2018-11-18 16:08:41,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:41,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:41,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:41,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:41,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-18 16:08:41,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:41,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:41,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:41,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:41,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:41,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:41,043 INFO L87 Difference]: Start difference. First operand 16649 states and 24455 transitions. Second operand 3 states. [2018-11-18 16:08:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:41,290 INFO L93 Difference]: Finished difference Result 38925 states and 57481 transitions. [2018-11-18 16:08:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:41,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 16:08:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:41,312 INFO L225 Difference]: With dead ends: 38925 [2018-11-18 16:08:41,312 INFO L226 Difference]: Without dead ends: 22539 [2018-11-18 16:08:41,334 INFO L604 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-18 16:08:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22539 states. [2018-11-18 16:08:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22539 to 22537. [2018-11-18 16:08:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22537 states. [2018-11-18 16:08:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 33031 transitions. [2018-11-18 16:08:41,818 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 33031 transitions. Word has length 34 [2018-11-18 16:08:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:41,818 INFO L480 AbstractCegarLoop]: Abstraction has 22537 states and 33031 transitions. [2018-11-18 16:08:41,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 33031 transitions. [2018-11-18 16:08:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 16:08:41,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:41,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:41,836 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:41,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1270531102, now seen corresponding path program 1 times [2018-11-18 16:08:41,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:41,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:41,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:41,850 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-18 16:08:41,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:41,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:41,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:41,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:41,851 INFO L87 Difference]: Start difference. First operand 22537 states and 33031 transitions. Second operand 3 states. [2018-11-18 16:08:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:42,085 INFO L93 Difference]: Finished difference Result 33805 states and 49417 transitions. [2018-11-18 16:08:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:42,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 16:08:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:42,116 INFO L225 Difference]: With dead ends: 33805 [2018-11-18 16:08:42,116 INFO L226 Difference]: Without dead ends: 22795 [2018-11-18 16:08:42,134 INFO L604 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-18 16:08:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22795 states. [2018-11-18 16:08:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22795 to 22793. [2018-11-18 16:08:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22793 states. [2018-11-18 16:08:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22793 states to 22793 states and 33031 transitions. [2018-11-18 16:08:42,639 INFO L78 Accepts]: Start accepts. Automaton has 22793 states and 33031 transitions. Word has length 35 [2018-11-18 16:08:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:42,639 INFO L480 AbstractCegarLoop]: Abstraction has 22793 states and 33031 transitions. [2018-11-18 16:08:42,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 22793 states and 33031 transitions. [2018-11-18 16:08:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 16:08:42,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:42,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:42,652 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:42,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1335492452, now seen corresponding path program 1 times [2018-11-18 16:08:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:42,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:42,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:42,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:42,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:42,671 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-18 16:08:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:42,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:42,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:42,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:42,672 INFO L87 Difference]: Start difference. First operand 22793 states and 33031 transitions. Second operand 3 states. [2018-11-18 16:08:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:42,948 INFO L93 Difference]: Finished difference Result 39949 states and 59145 transitions. [2018-11-18 16:08:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:42,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 16:08:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:42,986 INFO L225 Difference]: With dead ends: 39949 [2018-11-18 16:08:42,986 INFO L226 Difference]: Without dead ends: 39947 [2018-11-18 16:08:42,998 INFO L604 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-18 16:08:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39947 states. [2018-11-18 16:08:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39947 to 33289. [2018-11-18 16:08:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33289 states. [2018-11-18 16:08:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33289 states to 33289 states and 46855 transitions. [2018-11-18 16:08:43,471 INFO L78 Accepts]: Start accepts. Automaton has 33289 states and 46855 transitions. Word has length 35 [2018-11-18 16:08:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:43,471 INFO L480 AbstractCegarLoop]: Abstraction has 33289 states and 46855 transitions. [2018-11-18 16:08:43,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 33289 states and 46855 transitions. [2018-11-18 16:08:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 16:08:43,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:43,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:43,490 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:43,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash -658652254, now seen corresponding path program 1 times [2018-11-18 16:08:43,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:43,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:43,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:43,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:43,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:43,525 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-18 16:08:43,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:43,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:43,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:43,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:43,527 INFO L87 Difference]: Start difference. First operand 33289 states and 46855 transitions. Second operand 3 states. [2018-11-18 16:08:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:44,022 INFO L93 Difference]: Finished difference Result 77325 states and 109321 transitions. [2018-11-18 16:08:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:44,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 16:08:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:44,051 INFO L225 Difference]: With dead ends: 77325 [2018-11-18 16:08:44,051 INFO L226 Difference]: Without dead ends: 44555 [2018-11-18 16:08:44,071 INFO L604 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-18 16:08:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44555 states. [2018-11-18 16:08:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44555 to 44553. [2018-11-18 16:08:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44553 states. [2018-11-18 16:08:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44553 states to 44553 states and 62471 transitions. [2018-11-18 16:08:44,617 INFO L78 Accepts]: Start accepts. Automaton has 44553 states and 62471 transitions. Word has length 35 [2018-11-18 16:08:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:44,617 INFO L480 AbstractCegarLoop]: Abstraction has 44553 states and 62471 transitions. [2018-11-18 16:08:44,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44553 states and 62471 transitions. [2018-11-18 16:08:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:08:44,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:44,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:44,630 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:44,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1549192118, now seen corresponding path program 1 times [2018-11-18 16:08:44,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:44,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:44,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:44,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:44,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:44,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:44,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:44,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:44,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:44,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:44,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:44,649 INFO L87 Difference]: Start difference. First operand 44553 states and 62471 transitions. Second operand 3 states. [2018-11-18 16:08:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:45,092 INFO L93 Difference]: Finished difference Result 66829 states and 93449 transitions. [2018-11-18 16:08:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:45,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 16:08:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:45,124 INFO L225 Difference]: With dead ends: 66829 [2018-11-18 16:08:45,124 INFO L226 Difference]: Without dead ends: 45067 [2018-11-18 16:08:45,139 INFO L604 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-18 16:08:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45067 states. [2018-11-18 16:08:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45067 to 45065. [2018-11-18 16:08:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-11-18 16:08:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 62471 transitions. [2018-11-18 16:08:45,679 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 62471 transitions. Word has length 36 [2018-11-18 16:08:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:45,679 INFO L480 AbstractCegarLoop]: Abstraction has 45065 states and 62471 transitions. [2018-11-18 16:08:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 62471 transitions. [2018-11-18 16:08:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:08:45,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:45,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:45,693 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:45,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1056831436, now seen corresponding path program 1 times [2018-11-18 16:08:45,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:45,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:45,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:45,722 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-18 16:08:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:45,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:45,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:45,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:45,723 INFO L87 Difference]: Start difference. First operand 45065 states and 62471 transitions. Second operand 3 states. [2018-11-18 16:08:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:46,429 INFO L93 Difference]: Finished difference Result 77837 states and 110089 transitions. [2018-11-18 16:08:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:46,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 16:08:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:46,476 INFO L225 Difference]: With dead ends: 77837 [2018-11-18 16:08:46,476 INFO L226 Difference]: Without dead ends: 77835 [2018-11-18 16:08:46,483 INFO L604 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-18 16:08:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77835 states. [2018-11-18 16:08:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77835 to 66569. [2018-11-18 16:08:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66569 states. [2018-11-18 16:08:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66569 states to 66569 states and 89607 transitions. [2018-11-18 16:08:47,196 INFO L78 Accepts]: Start accepts. Automaton has 66569 states and 89607 transitions. Word has length 36 [2018-11-18 16:08:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 66569 states and 89607 transitions. [2018-11-18 16:08:47,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 66569 states and 89607 transitions. [2018-11-18 16:08:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:08:47,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:47,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:47,226 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:47,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:47,226 INFO L82 PathProgramCache]: Analyzing trace with hash -937313270, now seen corresponding path program 1 times [2018-11-18 16:08:47,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:47,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:47,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:47,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:47,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:47,254 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-18 16:08:47,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:47,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:47,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:47,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:47,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:47,255 INFO L87 Difference]: Start difference. First operand 66569 states and 89607 transitions. Second operand 3 states. [2018-11-18 16:08:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:48,079 INFO L93 Difference]: Finished difference Result 153613 states and 207369 transitions. [2018-11-18 16:08:48,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 16:08:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:48,149 INFO L225 Difference]: With dead ends: 153613 [2018-11-18 16:08:48,149 INFO L226 Difference]: Without dead ends: 88075 [2018-11-18 16:08:48,190 INFO L604 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-18 16:08:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88075 states. [2018-11-18 16:08:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88075 to 88073. [2018-11-18 16:08:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88073 states. [2018-11-18 16:08:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88073 states to 88073 states and 117767 transitions. [2018-11-18 16:08:49,557 INFO L78 Accepts]: Start accepts. Automaton has 88073 states and 117767 transitions. Word has length 36 [2018-11-18 16:08:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:49,558 INFO L480 AbstractCegarLoop]: Abstraction has 88073 states and 117767 transitions. [2018-11-18 16:08:49,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 88073 states and 117767 transitions. [2018-11-18 16:08:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:08:49,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:49,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:49,584 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:49,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1597748681, now seen corresponding path program 1 times [2018-11-18 16:08:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:49,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:49,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:49,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:49,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:49,604 INFO L87 Difference]: Start difference. First operand 88073 states and 117767 transitions. Second operand 3 states. [2018-11-18 16:08:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:50,227 INFO L93 Difference]: Finished difference Result 132109 states and 176137 transitions. [2018-11-18 16:08:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:50,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 16:08:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:50,289 INFO L225 Difference]: With dead ends: 132109 [2018-11-18 16:08:50,290 INFO L226 Difference]: Without dead ends: 89099 [2018-11-18 16:08:50,315 INFO L604 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-18 16:08:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89099 states. [2018-11-18 16:08:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89099 to 89097. [2018-11-18 16:08:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89097 states. [2018-11-18 16:08:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89097 states to 89097 states and 117767 transitions. [2018-11-18 16:08:51,608 INFO L78 Accepts]: Start accepts. Automaton has 89097 states and 117767 transitions. Word has length 37 [2018-11-18 16:08:51,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,608 INFO L480 AbstractCegarLoop]: Abstraction has 89097 states and 117767 transitions. [2018-11-18 16:08:51,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 89097 states and 117767 transitions. [2018-11-18 16:08:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:08:51,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,632 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1008274873, now seen corresponding path program 1 times [2018-11-18 16:08:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,658 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-18 16:08:51,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,659 INFO L87 Difference]: Start difference. First operand 89097 states and 117767 transitions. Second operand 3 states. [2018-11-18 16:08:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:52,783 INFO L93 Difference]: Finished difference Result 151565 states and 203785 transitions. [2018-11-18 16:08:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:52,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 16:08:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:52,903 INFO L225 Difference]: With dead ends: 151565 [2018-11-18 16:08:52,903 INFO L226 Difference]: Without dead ends: 151563 [2018-11-18 16:08:52,931 INFO L604 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-18 16:08:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-18 16:08:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 133129. [2018-11-18 16:08:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133129 states. [2018-11-18 16:08:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133129 states to 133129 states and 171015 transitions. [2018-11-18 16:08:55,719 INFO L78 Accepts]: Start accepts. Automaton has 133129 states and 171015 transitions. Word has length 37 [2018-11-18 16:08:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:55,719 INFO L480 AbstractCegarLoop]: Abstraction has 133129 states and 171015 transitions. [2018-11-18 16:08:55,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 133129 states and 171015 transitions. [2018-11-18 16:08:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:08:55,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:55,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:55,774 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:55,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -985869833, now seen corresponding path program 1 times [2018-11-18 16:08:55,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:55,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:55,807 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-18 16:08:55,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:55,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:55,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:55,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:55,808 INFO L87 Difference]: Start difference. First operand 133129 states and 171015 transitions. Second operand 3 states. [2018-11-18 16:08:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:57,259 INFO L93 Difference]: Finished difference Result 305165 states and 392201 transitions. [2018-11-18 16:08:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:57,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 16:08:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:57,397 INFO L225 Difference]: With dead ends: 305165 [2018-11-18 16:08:57,397 INFO L226 Difference]: Without dead ends: 174091 [2018-11-18 16:08:57,720 INFO L604 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-18 16:08:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174091 states. [2018-11-18 16:08:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174091 to 174089. [2018-11-18 16:08:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174089 states. [2018-11-18 16:08:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174089 states to 174089 states and 221191 transitions. [2018-11-18 16:08:59,727 INFO L78 Accepts]: Start accepts. Automaton has 174089 states and 221191 transitions. Word has length 37 [2018-11-18 16:08:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:59,728 INFO L480 AbstractCegarLoop]: Abstraction has 174089 states and 221191 transitions. [2018-11-18 16:08:59,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 174089 states and 221191 transitions. [2018-11-18 16:08:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 16:08:59,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:59,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:59,784 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:59,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1191965503, now seen corresponding path program 1 times [2018-11-18 16:08:59,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:59,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:59,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:59,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:59,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:59,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:59,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:59,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:59,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:59,806 INFO L87 Difference]: Start difference. First operand 174089 states and 221191 transitions. Second operand 3 states. [2018-11-18 16:09:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:01,554 INFO L93 Difference]: Finished difference Result 261133 states and 330761 transitions. [2018-11-18 16:09:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:01,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 16:09:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:01,693 INFO L225 Difference]: With dead ends: 261133 [2018-11-18 16:09:01,693 INFO L226 Difference]: Without dead ends: 176139 [2018-11-18 16:09:01,740 INFO L604 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-18 16:09:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176139 states. [2018-11-18 16:09:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176139 to 176137. [2018-11-18 16:09:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176137 states. [2018-11-18 16:09:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176137 states to 176137 states and 221191 transitions. [2018-11-18 16:09:03,879 INFO L78 Accepts]: Start accepts. Automaton has 176137 states and 221191 transitions. Word has length 38 [2018-11-18 16:09:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:03,879 INFO L480 AbstractCegarLoop]: Abstraction has 176137 states and 221191 transitions. [2018-11-18 16:09:03,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 176137 states and 221191 transitions. [2018-11-18 16:09:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 16:09:03,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:03,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:03,936 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:03,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -496978239, now seen corresponding path program 1 times [2018-11-18 16:09:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:03,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:03,962 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-18 16:09:03,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:03,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:03,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:03,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:03,963 INFO L87 Difference]: Start difference. First operand 176137 states and 221191 transitions. Second operand 3 states. [2018-11-18 16:09:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:06,770 INFO L93 Difference]: Finished difference Result 516109 states and 638985 transitions. [2018-11-18 16:09:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:06,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 16:09:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:07,058 INFO L225 Difference]: With dead ends: 516109 [2018-11-18 16:09:07,058 INFO L226 Difference]: Without dead ends: 344075 [2018-11-18 16:09:07,159 INFO L604 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-18 16:09:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344075 states. [2018-11-18 16:09:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344075 to 344073. [2018-11-18 16:09:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-18 16:09:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 417799 transitions. [2018-11-18 16:09:11,733 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 417799 transitions. Word has length 38 [2018-11-18 16:09:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:11,733 INFO L480 AbstractCegarLoop]: Abstraction has 344073 states and 417799 transitions. [2018-11-18 16:09:11,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 417799 transitions. [2018-11-18 16:09:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 16:09:11,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:11,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:11,856 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:11,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1497166467, now seen corresponding path program 1 times [2018-11-18 16:09:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:11,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:11,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:11,887 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-18 16:09:11,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:11,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:11,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:11,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:11,888 INFO L87 Difference]: Start difference. First operand 344073 states and 417799 transitions. Second operand 3 states. [2018-11-18 16:09:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:17,485 INFO L93 Difference]: Finished difference Result 372749 states and 462857 transitions. [2018-11-18 16:09:17,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:17,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 16:09:17,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:17,801 INFO L225 Difference]: With dead ends: 372749 [2018-11-18 16:09:17,801 INFO L226 Difference]: Without dead ends: 372747 [2018-11-18 16:09:17,846 INFO L604 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-18 16:09:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372747 states. [2018-11-18 16:09:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372747 to 344073. [2018-11-18 16:09:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-18 16:09:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 413703 transitions. [2018-11-18 16:09:22,653 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 413703 transitions. Word has length 38 [2018-11-18 16:09:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:22,653 INFO L480 AbstractCegarLoop]: Abstraction has 344073 states and 413703 transitions. [2018-11-18 16:09:22,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 413703 transitions. [2018-11-18 16:09:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 16:09:22,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:22,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:22,782 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:22,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1773759628, now seen corresponding path program 1 times [2018-11-18 16:09:22,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:22,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:22,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:22,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:22,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:22,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:22,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:22,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:22,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:22,809 INFO L87 Difference]: Start difference. First operand 344073 states and 413703 transitions. Second operand 3 states. [2018-11-18 16:09:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:27,922 INFO L93 Difference]: Finished difference Result 569357 states and 688137 transitions. [2018-11-18 16:09:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:27,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 16:09:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:28,344 INFO L225 Difference]: With dead ends: 569357 [2018-11-18 16:09:28,344 INFO L226 Difference]: Without dead ends: 569355 [2018-11-18 16:09:28,400 INFO L604 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-18 16:09:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569355 states. [2018-11-18 16:09:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569355 to 528393. [2018-11-18 16:09:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528393 states. [2018-11-18 16:09:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528393 states to 528393 states and 622599 transitions. [2018-11-18 16:09:39,047 INFO L78 Accepts]: Start accepts. Automaton has 528393 states and 622599 transitions. Word has length 39 [2018-11-18 16:09:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:39,047 INFO L480 AbstractCegarLoop]: Abstraction has 528393 states and 622599 transitions. [2018-11-18 16:09:39,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 528393 states and 622599 transitions. [2018-11-18 16:09:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 16:09:39,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:39,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:39,324 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:39,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash -220385078, now seen corresponding path program 1 times [2018-11-18 16:09:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:39,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:39,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:39,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:39,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:39,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:39,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:39,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:39,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:39,364 INFO L87 Difference]: Start difference. First operand 528393 states and 622599 transitions. Second operand 3 states. [2018-11-18 16:09:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:45,780 INFO L93 Difference]: Finished difference Result 1200141 states and 1409033 transitions. [2018-11-18 16:09:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:45,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 16:09:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:46,860 INFO L225 Difference]: With dead ends: 1200141 [2018-11-18 16:09:46,860 INFO L226 Difference]: Without dead ends: 675851 [2018-11-18 16:09:47,020 INFO L604 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-18 16:09:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675851 states. [2018-11-18 16:09:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675851 to 675849. [2018-11-18 16:09:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675849 states. [2018-11-18 16:10:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675849 states to 675849 states and 778247 transitions. [2018-11-18 16:10:04,067 INFO L78 Accepts]: Start accepts. Automaton has 675849 states and 778247 transitions. Word has length 39 [2018-11-18 16:10:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:10:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 675849 states and 778247 transitions. [2018-11-18 16:10:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:10:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 675849 states and 778247 transitions. [2018-11-18 16:10:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 16:10:04,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:10:04,325 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:10:04,325 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:10:04,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:10:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash -847810186, now seen corresponding path program 1 times [2018-11-18 16:10:04,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:10:04,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:04,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:10:04,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:04,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:10:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:10:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:10:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:10:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:10:04,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:10:04,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:10:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:10:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:10:04,360 INFO L87 Difference]: Start difference. First operand 675849 states and 778247 transitions. Second operand 3 states. [2018-11-18 16:10:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:10:10,277 INFO L93 Difference]: Finished difference Result 1019917 states and 1175561 transitions. [2018-11-18 16:10:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:10:10,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 16:10:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:10:10,802 INFO L225 Difference]: With dead ends: 1019917 [2018-11-18 16:10:10,802 INFO L226 Difference]: Without dead ends: 688139 [2018-11-18 16:10:10,989 INFO L604 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-18 16:10:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688139 states. [2018-11-18 16:10:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688139 to 688137. [2018-11-18 16:10:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688137 states. [2018-11-18 16:10:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688137 states to 688137 states and 786439 transitions. [2018-11-18 16:10:21,877 INFO L78 Accepts]: Start accepts. Automaton has 688137 states and 786439 transitions. Word has length 40 [2018-11-18 16:10:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:10:21,878 INFO L480 AbstractCegarLoop]: Abstraction has 688137 states and 786439 transitions. [2018-11-18 16:10:21,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:10:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 688137 states and 786439 transitions. [2018-11-18 16:10:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 16:10:22,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:10:22,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:10:22,118 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:10:22,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:10:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1758213368, now seen corresponding path program 1 times [2018-11-18 16:10:22,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:10:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:10:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:22,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:10:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:10:22,148 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-18 16:10:22,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:10:22,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:10:22,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:10:22,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:10:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:10:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:10:22,149 INFO L87 Difference]: Start difference. First operand 688137 states and 786439 transitions. Second operand 3 states. [2018-11-18 16:10:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:10:36,714 INFO L93 Difference]: Finished difference Result 1114123 states and 1261576 transitions. [2018-11-18 16:10:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:10:36,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 16:10:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:10:37,612 INFO L225 Difference]: With dead ends: 1114123 [2018-11-18 16:10:37,612 INFO L226 Difference]: Without dead ends: 1114121 [2018-11-18 16:10:37,721 INFO L604 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-18 16:10:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114121 states. [2018-11-18 16:10:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114121 to 1064969. [2018-11-18 16:10:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064969 states. [2018-11-18 16:10:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064969 states to 1064969 states and 1196039 transitions. [2018-11-18 16:10:51,432 INFO L78 Accepts]: Start accepts. Automaton has 1064969 states and 1196039 transitions. Word has length 40 [2018-11-18 16:10:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:10:51,433 INFO L480 AbstractCegarLoop]: Abstraction has 1064969 states and 1196039 transitions. [2018-11-18 16:10:51,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:10:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1064969 states and 1196039 transitions. [2018-11-18 16:10:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 16:10:52,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:10:52,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:10:52,830 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:10:52,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:10:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash -235931338, now seen corresponding path program 1 times [2018-11-18 16:10:52,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:10:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:10:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:52,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:10:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:10:52,871 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-18 16:10:52,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:10:52,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:10:52,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:10:52,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:10:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:10:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:10:52,872 INFO L87 Difference]: Start difference. First operand 1064969 states and 1196039 transitions. Second operand 3 states. [2018-11-18 16:11:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:11:12,450 INFO L93 Difference]: Finished difference Result 2392073 states and 2654215 transitions. [2018-11-18 16:11:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:11:12,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 16:11:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:11:12,451 INFO L225 Difference]: With dead ends: 2392073 [2018-11-18 16:11:12,451 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:11:13,532 INFO L604 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-18 16:11:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:11:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:11:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:11:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:11:13,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-18 16:11:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:11:13,533 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:11:13,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:11:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:11:13,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:11:13,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:11:13,612 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 16:11:13,612 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:11:13,612 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:11:13,612 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 16:11:13,612 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:11:13,612 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-18 16:11:13,613 INFO L425 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L428 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L421 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,614 INFO L425 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L428 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,615 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-18 16:11:13,616 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 16:11:13,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:11:13 BoogieIcfgContainer [2018-11-18 16:11:13,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:11:13,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:11:13,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:11:13,622 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:11:13,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:08:37" (3/4) ... [2018-11-18 16:11:13,626 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:11:13,631 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:11:13,632 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:11:13,636 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 16:11:13,636 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 16:11:13,637 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:11:13,686 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68071188-9879-430c-818c-77d3e79b4263/bin-2019/utaipan/witness.graphml [2018-11-18 16:11:13,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:11:13,688 INFO L168 Benchmark]: Toolchain (without parser) took 156869.88 ms. Allocated memory was 1.0 GB in the beginning and 8.0 GB in the end (delta: 7.0 GB). Free memory was 959.2 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-11-18 16:11:13,689 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:11:13,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.49 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:11:13,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:11:13,690 INFO L168 Benchmark]: Boogie Preprocessor took 52.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:11:13,690 INFO L168 Benchmark]: RCFGBuilder took 256.04 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:11:13,691 INFO L168 Benchmark]: TraceAbstraction took 156295.74 ms. Allocated memory was 1.2 GB in the beginning and 8.0 GB in the end (delta: 6.8 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-11-18 16:11:13,691 INFO L168 Benchmark]: Witness Printer took 64.83 ms. Allocated memory is still 8.0 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 125.4 kB). Peak memory consumption was 125.4 kB. Max. memory is 11.5 GB. [2018-11-18 16:11:13,692 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.49 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 256.04 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 156295.74 ms. Allocated memory was 1.2 GB in the beginning and 8.0 GB in the end (delta: 6.8 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 64.83 ms. Allocated memory is still 8.0 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 125.4 kB). Peak memory consumption was 125.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: 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, 60 locations, 1 error locations. SAFE Result, 156.2s OverallTime, 42 OverallIterations, 1 TraceHistogramMax, 76.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5286 SDtfs, 2640 SDslu, 3629 SDs, 0 SdLazy, 223 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064969occurred in iteration=41, 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: 75.9s AutomataMinimizationTime, 42 MinimizatonAttempts, 163885 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 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.8s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1347 ConstructedInterpolants, 0 QuantifiedInterpolants, 91126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...