./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:26:13,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:26:13,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:26:13,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:26:13,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:26:13,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:26:13,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:26:13,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:26:13,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:26:13,465 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:26:13,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:26:13,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:26:13,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:26:13,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:26:13,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:26:13,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:26:13,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:26:13,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:26:13,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:26:13,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:26:13,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:26:13,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:26:13,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:26:13,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:26:13,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:26:13,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:26:13,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:26:13,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:26:13,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:26:13,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:26:13,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:26:13,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:26:13,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:26:13,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:26:13,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:26:13,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:26:13,498 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:26:13,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:26:13,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:26:13,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:26:13,514 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:26:13,514 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:26:13,514 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:26:13,514 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:26:13,515 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:26:13,515 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:26:13,515 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:26:13,515 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:26:13,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:26:13,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:26:13,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:26:13,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:26:13,518 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:26:13,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:26:13,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:26:13,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:26:13,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:26:13,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:26:13,520 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:26:13,521 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_75cb7bda-20e7-4ee6-916a-e3b3e599f544/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-10-26 19:26:13,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:26:13,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:26:13,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:26:13,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:26:13,581 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:26:13,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:26:13,628 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/data/c1fafec0f/58c14de19e89455ea1e81f2b064a1509/FLAGc252e347a [2018-10-26 19:26:13,994 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:26:13,995 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:26:14,001 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/data/c1fafec0f/58c14de19e89455ea1e81f2b064a1509/FLAGc252e347a [2018-10-26 19:26:14,013 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/data/c1fafec0f/58c14de19e89455ea1e81f2b064a1509 [2018-10-26 19:26:14,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:26:14,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:26:14,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:26:14,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:26:14,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:26:14,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14, skipping insertion in model container [2018-10-26 19:26:14,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:26:14,052 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:26:14,176 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:26:14,180 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:26:14,202 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:26:14,211 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:26:14,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14 WrapperNode [2018-10-26 19:26:14,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:26:14,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:26:14,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:26:14,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:26:14,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:26:14,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:26:14,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:26:14,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:26:14,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... [2018-10-26 19:26:14,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:26:14,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:26:14,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:26:14,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:26:14,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/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-10-26 19:26:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:26:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:26:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:26:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:26:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:26:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:26:14,942 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:26:14,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:26:14 BoogieIcfgContainer [2018-10-26 19:26:14,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:26:14,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:26:14,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:26:14,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:26:14,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:26:14" (1/3) ... [2018-10-26 19:26:14,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1047ef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:26:14, skipping insertion in model container [2018-10-26 19:26:14,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:14" (2/3) ... [2018-10-26 19:26:14,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1047ef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:26:14, skipping insertion in model container [2018-10-26 19:26:14,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:26:14" (3/3) ... [2018-10-26 19:26:14,949 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:26:14,955 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:26:14,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:26:14,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:26:14,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:26:14,997 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:26:14,997 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:26:14,997 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:26:14,997 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:26:14,997 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:26:14,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:26:14,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:26:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-10-26 19:26:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:26:15,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:15,019 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] [2018-10-26 19:26:15,021 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:15,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-10-26 19:26:15,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:15,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:15,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:15,200 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:15,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:15,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:15,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:15,219 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-10-26 19:26:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:15,307 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-10-26 19:26:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:15,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:26:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:15,317 INFO L225 Difference]: With dead ends: 107 [2018-10-26 19:26:15,317 INFO L226 Difference]: Without dead ends: 92 [2018-10-26 19:26:15,319 INFO L605 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-10-26 19:26:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-26 19:26:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-10-26 19:26:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-26 19:26:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-10-26 19:26:15,354 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-10-26 19:26:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:15,355 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-10-26 19:26:15,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-10-26 19:26:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:26:15,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:15,356 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] [2018-10-26 19:26:15,356 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:15,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-10-26 19:26:15,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:15,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:15,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:15,416 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:15,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:15,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:15,420 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-10-26 19:26:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:15,483 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-10-26 19:26:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:15,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:26:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:15,485 INFO L225 Difference]: With dead ends: 150 [2018-10-26 19:26:15,486 INFO L226 Difference]: Without dead ends: 92 [2018-10-26 19:26:15,487 INFO L605 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-10-26 19:26:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-26 19:26:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-10-26 19:26:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-26 19:26:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-10-26 19:26:15,495 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-10-26 19:26:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:15,496 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-10-26 19:26:15,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-10-26 19:26:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:26:15,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:15,497 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] [2018-10-26 19:26:15,497 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:15,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-10-26 19:26:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,499 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:15,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:15,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:15,554 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:15,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:15,555 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-10-26 19:26:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:15,626 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-10-26 19:26:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:15,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:26:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:15,628 INFO L225 Difference]: With dead ends: 139 [2018-10-26 19:26:15,628 INFO L226 Difference]: Without dead ends: 96 [2018-10-26 19:26:15,629 INFO L605 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-10-26 19:26:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-26 19:26:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-26 19:26:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-26 19:26:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-10-26 19:26:15,639 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-10-26 19:26:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:15,639 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-10-26 19:26:15,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-10-26 19:26:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:26:15,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:15,640 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] [2018-10-26 19:26:15,640 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:15,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-10-26 19:26:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:15,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:15,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:15,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:15,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:15,702 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-10-26 19:26:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:15,744 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-10-26 19:26:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:15,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:26:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:15,746 INFO L225 Difference]: With dead ends: 177 [2018-10-26 19:26:15,746 INFO L226 Difference]: Without dead ends: 175 [2018-10-26 19:26:15,747 INFO L605 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-10-26 19:26:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-26 19:26:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-10-26 19:26:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-26 19:26:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-10-26 19:26:15,757 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-10-26 19:26:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:15,757 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-10-26 19:26:15,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-10-26 19:26:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:26:15,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:15,759 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] [2018-10-26 19:26:15,759 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:15,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-10-26 19:26:15,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:15,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:15,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:15,856 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:15,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:15,857 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-10-26 19:26:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:15,921 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-10-26 19:26:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:15,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:26:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:15,922 INFO L225 Difference]: With dead ends: 291 [2018-10-26 19:26:15,922 INFO L226 Difference]: Without dead ends: 177 [2018-10-26 19:26:15,923 INFO L605 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-10-26 19:26:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-26 19:26:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-26 19:26:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-26 19:26:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-10-26 19:26:15,931 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-10-26 19:26:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:15,931 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-10-26 19:26:15,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-10-26 19:26:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:26:15,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:15,932 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-10-26 19:26:15,933 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:15,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-10-26 19:26:15,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:15,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,008 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,009 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-10-26 19:26:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,052 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-10-26 19:26:16,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:16,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:26:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,053 INFO L225 Difference]: With dead ends: 262 [2018-10-26 19:26:16,053 INFO L226 Difference]: Without dead ends: 179 [2018-10-26 19:26:16,053 INFO L605 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-10-26 19:26:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-26 19:26:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-26 19:26:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-26 19:26:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-10-26 19:26:16,063 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-10-26 19:26:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:16,063 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-10-26 19:26:16,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-10-26 19:26:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:26:16,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:16,064 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-10-26 19:26:16,064 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:16,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-10-26 19:26:16,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,121 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,122 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-10-26 19:26:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,177 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-10-26 19:26:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:16,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:26:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,179 INFO L225 Difference]: With dead ends: 333 [2018-10-26 19:26:16,179 INFO L226 Difference]: Without dead ends: 331 [2018-10-26 19:26:16,180 INFO L605 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-10-26 19:26:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-26 19:26:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-10-26 19:26:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-26 19:26:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-10-26 19:26:16,202 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-10-26 19:26:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:16,203 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-10-26 19:26:16,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-10-26 19:26:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:26:16,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:16,204 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-10-26 19:26:16,204 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:16,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-10-26 19:26:16,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:16,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,296 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-10-26 19:26:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,331 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-10-26 19:26:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:16,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:26:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,333 INFO L225 Difference]: With dead ends: 565 [2018-10-26 19:26:16,333 INFO L226 Difference]: Without dead ends: 339 [2018-10-26 19:26:16,335 INFO L605 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-10-26 19:26:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-26 19:26:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-10-26 19:26:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-26 19:26:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-10-26 19:26:16,354 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-10-26 19:26:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:16,354 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-10-26 19:26:16,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-10-26 19:26:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:26:16,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:16,356 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-10-26 19:26:16,356 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:16,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-10-26 19:26:16,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,427 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,428 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-10-26 19:26:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,471 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-10-26 19:26:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:16,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:26:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,473 INFO L225 Difference]: With dead ends: 505 [2018-10-26 19:26:16,473 INFO L226 Difference]: Without dead ends: 343 [2018-10-26 19:26:16,474 INFO L605 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-10-26 19:26:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-26 19:26:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-26 19:26:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-26 19:26:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-10-26 19:26:16,484 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-10-26 19:26:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:16,484 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-10-26 19:26:16,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-10-26 19:26:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:26:16,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:16,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] [2018-10-26 19:26:16,491 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:16,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-10-26 19:26:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,568 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-10-26 19:26:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,639 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-10-26 19:26:16,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:16,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:26:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,643 INFO L225 Difference]: With dead ends: 637 [2018-10-26 19:26:16,643 INFO L226 Difference]: Without dead ends: 635 [2018-10-26 19:26:16,643 INFO L605 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-10-26 19:26:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-10-26 19:26:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-10-26 19:26:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-10-26 19:26:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-10-26 19:26:16,660 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-10-26 19:26:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:16,660 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-10-26 19:26:16,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-10-26 19:26:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:26:16,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:16,663 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-10-26 19:26:16,663 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:16,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-10-26 19:26:16,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:16,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:16,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,740 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-10-26 19:26:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,843 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-10-26 19:26:16,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:16,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:26:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,847 INFO L225 Difference]: With dead ends: 1109 [2018-10-26 19:26:16,847 INFO L226 Difference]: Without dead ends: 659 [2018-10-26 19:26:16,848 INFO L605 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-10-26 19:26:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-26 19:26:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-10-26 19:26:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-10-26 19:26:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-10-26 19:26:16,868 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-10-26 19:26:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:16,868 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-10-26 19:26:16,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-10-26 19:26:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:26:16,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:16,871 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-10-26 19:26:16,871 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:16,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-10-26 19:26:16,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:16,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:16,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:16,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:16,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:16,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:16,940 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-10-26 19:26:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:17,035 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-10-26 19:26:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:17,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:26:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:17,038 INFO L225 Difference]: With dead ends: 985 [2018-10-26 19:26:17,038 INFO L226 Difference]: Without dead ends: 667 [2018-10-26 19:26:17,039 INFO L605 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-10-26 19:26:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-26 19:26:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-10-26 19:26:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-10-26 19:26:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-10-26 19:26:17,059 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-10-26 19:26:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:17,060 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-10-26 19:26:17,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-10-26 19:26:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:26:17,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:17,061 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-10-26 19:26:17,061 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:17,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:17,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-10-26 19:26:17,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:17,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:17,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:17,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:17,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:17,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:17,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:17,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:17,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:17,145 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-10-26 19:26:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:17,261 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-10-26 19:26:17,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:17,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:26:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:17,265 INFO L225 Difference]: With dead ends: 1933 [2018-10-26 19:26:17,266 INFO L226 Difference]: Without dead ends: 1291 [2018-10-26 19:26:17,268 INFO L605 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-10-26 19:26:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-26 19:26:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-10-26 19:26:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-10-26 19:26:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-10-26 19:26:17,304 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-10-26 19:26:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:17,305 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-10-26 19:26:17,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-10-26 19:26:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:26:17,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:17,306 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-10-26 19:26:17,306 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:17,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-10-26 19:26:17,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:17,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:17,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:17,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:17,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:17,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:17,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:17,385 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-10-26 19:26:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:17,485 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-10-26 19:26:17,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:17,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:26:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:17,491 INFO L225 Difference]: With dead ends: 1597 [2018-10-26 19:26:17,492 INFO L226 Difference]: Without dead ends: 1595 [2018-10-26 19:26:17,492 INFO L605 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-10-26 19:26:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-10-26 19:26:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-10-26 19:26:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-10-26 19:26:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-10-26 19:26:17,533 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-10-26 19:26:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:17,534 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-10-26 19:26:17,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-10-26 19:26:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:26:17,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:17,536 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-10-26 19:26:17,536 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:17,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-10-26 19:26:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:17,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:17,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:17,616 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:17,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:17,617 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-10-26 19:26:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:17,721 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-10-26 19:26:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:17,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:26:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:17,728 INFO L225 Difference]: With dead ends: 2365 [2018-10-26 19:26:17,728 INFO L226 Difference]: Without dead ends: 2363 [2018-10-26 19:26:17,729 INFO L605 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-10-26 19:26:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-10-26 19:26:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-10-26 19:26:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-10-26 19:26:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-10-26 19:26:17,782 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-10-26 19:26:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:17,782 INFO L481 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-10-26 19:26:17,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-10-26 19:26:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:26:17,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:17,784 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-10-26 19:26:17,784 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:17,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-10-26 19:26:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:17,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:17,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:17,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:17,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:17,853 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-10-26 19:26:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:17,974 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-10-26 19:26:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:17,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:26:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:17,983 INFO L225 Difference]: With dead ends: 4317 [2018-10-26 19:26:17,983 INFO L226 Difference]: Without dead ends: 2523 [2018-10-26 19:26:17,987 INFO L605 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-10-26 19:26:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-10-26 19:26:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-10-26 19:26:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-10-26 19:26:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-10-26 19:26:18,058 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-10-26 19:26:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:18,058 INFO L481 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-10-26 19:26:18,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-10-26 19:26:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:26:18,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:18,061 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-10-26 19:26:18,061 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:18,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:18,061 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-10-26 19:26:18,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:18,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:18,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:18,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:18,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:18,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:18,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:18,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:18,106 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-10-26 19:26:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:18,208 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-10-26 19:26:18,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:18,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:26:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:18,216 INFO L225 Difference]: With dead ends: 3805 [2018-10-26 19:26:18,217 INFO L226 Difference]: Without dead ends: 2571 [2018-10-26 19:26:18,220 INFO L605 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-10-26 19:26:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-10-26 19:26:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-10-26 19:26:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-10-26 19:26:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-10-26 19:26:18,303 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-10-26 19:26:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:18,303 INFO L481 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-10-26 19:26:18,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-10-26 19:26:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:26:18,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:18,305 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-10-26 19:26:18,308 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:18,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-10-26 19:26:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:18,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:18,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:18,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:18,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:18,380 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-10-26 19:26:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:18,520 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-10-26 19:26:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:18,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:26:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:18,534 INFO L225 Difference]: With dead ends: 4621 [2018-10-26 19:26:18,534 INFO L226 Difference]: Without dead ends: 4619 [2018-10-26 19:26:18,535 INFO L605 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-10-26 19:26:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-10-26 19:26:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-10-26 19:26:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-10-26 19:26:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-10-26 19:26:18,617 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-10-26 19:26:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:18,617 INFO L481 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-10-26 19:26:18,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-10-26 19:26:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:26:18,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:18,623 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-10-26 19:26:18,623 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:18,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-10-26 19:26:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:18,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:18,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:18,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:18,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:18,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:18,700 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-10-26 19:26:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:18,838 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-10-26 19:26:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:26:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:18,852 INFO L225 Difference]: With dead ends: 8589 [2018-10-26 19:26:18,852 INFO L226 Difference]: Without dead ends: 5003 [2018-10-26 19:26:18,858 INFO L605 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-10-26 19:26:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-10-26 19:26:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-10-26 19:26:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-10-26 19:26:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-10-26 19:26:18,963 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-10-26 19:26:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:18,964 INFO L481 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-10-26 19:26:18,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-10-26 19:26:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:26:18,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:18,969 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-10-26 19:26:18,969 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:18,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-10-26 19:26:18,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:18,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:18,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:19,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:19,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:19,039 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:19,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:19,040 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-10-26 19:26:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:19,176 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-10-26 19:26:19,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:19,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:26:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:19,187 INFO L225 Difference]: With dead ends: 7501 [2018-10-26 19:26:19,187 INFO L226 Difference]: Without dead ends: 5067 [2018-10-26 19:26:19,192 INFO L605 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-10-26 19:26:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-10-26 19:26:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-10-26 19:26:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-10-26 19:26:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-10-26 19:26:19,292 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-10-26 19:26:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:19,293 INFO L481 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-10-26 19:26:19,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-10-26 19:26:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:26:19,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:19,299 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-10-26 19:26:19,299 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:19,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-10-26 19:26:19,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:19,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:19,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:19,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:19,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:19,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:19,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:19,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:19,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:19,368 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-10-26 19:26:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:19,534 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-10-26 19:26:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:19,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:26:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:19,550 INFO L225 Difference]: With dead ends: 8973 [2018-10-26 19:26:19,550 INFO L226 Difference]: Without dead ends: 8971 [2018-10-26 19:26:19,554 INFO L605 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-10-26 19:26:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-10-26 19:26:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-10-26 19:26:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-10-26 19:26:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-10-26 19:26:19,687 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-10-26 19:26:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:19,687 INFO L481 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-10-26 19:26:19,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-10-26 19:26:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:26:19,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:19,697 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-10-26 19:26:19,698 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:19,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-10-26 19:26:19,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:19,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:19,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:19,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:19,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:19,767 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:19,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:19,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:19,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:19,768 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-10-26 19:26:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:20,012 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-10-26 19:26:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:20,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:26:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:20,027 INFO L225 Difference]: With dead ends: 17037 [2018-10-26 19:26:20,027 INFO L226 Difference]: Without dead ends: 9867 [2018-10-26 19:26:20,036 INFO L605 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-10-26 19:26:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2018-10-26 19:26:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9865. [2018-10-26 19:26:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-10-26 19:26:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 14343 transitions. [2018-10-26 19:26:20,219 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 14343 transitions. Word has length 31 [2018-10-26 19:26:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:20,219 INFO L481 AbstractCegarLoop]: Abstraction has 9865 states and 14343 transitions. [2018-10-26 19:26:20,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 14343 transitions. [2018-10-26 19:26:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:26:20,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:20,229 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-10-26 19:26:20,229 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:20,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2139393499, now seen corresponding path program 1 times [2018-10-26 19:26:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:20,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:20,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:20,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:20,291 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:20,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:20,292 INFO L87 Difference]: Start difference. First operand 9865 states and 14343 transitions. Second operand 3 states. [2018-10-26 19:26:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:20,489 INFO L93 Difference]: Finished difference Result 14797 states and 21449 transitions. [2018-10-26 19:26:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:20,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:26:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:20,506 INFO L225 Difference]: With dead ends: 14797 [2018-10-26 19:26:20,506 INFO L226 Difference]: Without dead ends: 9995 [2018-10-26 19:26:20,515 INFO L605 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-10-26 19:26:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2018-10-26 19:26:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9993. [2018-10-26 19:26:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9993 states. [2018-10-26 19:26:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 14343 transitions. [2018-10-26 19:26:20,701 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 14343 transitions. Word has length 32 [2018-10-26 19:26:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:20,701 INFO L481 AbstractCegarLoop]: Abstraction has 9993 states and 14343 transitions. [2018-10-26 19:26:20,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 14343 transitions. [2018-10-26 19:26:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:26:20,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:20,710 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-10-26 19:26:20,710 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:20,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:20,710 INFO L82 PathProgramCache]: Analyzing trace with hash 551045597, now seen corresponding path program 1 times [2018-10-26 19:26:20,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:20,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:20,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:20,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:20,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:20,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:20,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:20,776 INFO L87 Difference]: Start difference. First operand 9993 states and 14343 transitions. Second operand 3 states. [2018-10-26 19:26:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:21,026 INFO L93 Difference]: Finished difference Result 17421 states and 25481 transitions. [2018-10-26 19:26:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:21,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:26:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:21,055 INFO L225 Difference]: With dead ends: 17421 [2018-10-26 19:26:21,055 INFO L226 Difference]: Without dead ends: 17419 [2018-10-26 19:26:21,061 INFO L605 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-10-26 19:26:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2018-10-26 19:26:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 14601. [2018-10-26 19:26:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2018-10-26 19:26:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20359 transitions. [2018-10-26 19:26:21,405 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20359 transitions. Word has length 32 [2018-10-26 19:26:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:21,405 INFO L481 AbstractCegarLoop]: Abstraction has 14601 states and 20359 transitions. [2018-10-26 19:26:21,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20359 transitions. [2018-10-26 19:26:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:26:21,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:21,422 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-10-26 19:26:21,422 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:21,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash -470022757, now seen corresponding path program 1 times [2018-10-26 19:26:21,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:21,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:21,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:21,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:21,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:21,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:21,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:21,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:21,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:21,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:21,492 INFO L87 Difference]: Start difference. First operand 14601 states and 20359 transitions. Second operand 3 states. [2018-10-26 19:26:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:21,818 INFO L93 Difference]: Finished difference Result 33805 states and 47241 transitions. [2018-10-26 19:26:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:21,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:26:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:21,846 INFO L225 Difference]: With dead ends: 33805 [2018-10-26 19:26:21,846 INFO L226 Difference]: Without dead ends: 19467 [2018-10-26 19:26:21,867 INFO L605 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-10-26 19:26:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2018-10-26 19:26:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 19465. [2018-10-26 19:26:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19465 states. [2018-10-26 19:26:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19465 states to 19465 states and 26887 transitions. [2018-10-26 19:26:22,204 INFO L78 Accepts]: Start accepts. Automaton has 19465 states and 26887 transitions. Word has length 32 [2018-10-26 19:26:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:22,205 INFO L481 AbstractCegarLoop]: Abstraction has 19465 states and 26887 transitions. [2018-10-26 19:26:22,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 19465 states and 26887 transitions. [2018-10-26 19:26:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:26:22,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:22,221 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-10-26 19:26:22,221 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:22,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash -97240540, now seen corresponding path program 1 times [2018-10-26 19:26:22,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:22,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:22,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:22,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:22,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:22,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:22,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:22,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:22,296 INFO L87 Difference]: Start difference. First operand 19465 states and 26887 transitions. Second operand 3 states. [2018-10-26 19:26:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:22,595 INFO L93 Difference]: Finished difference Result 29197 states and 40201 transitions. [2018-10-26 19:26:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:22,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:26:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:22,614 INFO L225 Difference]: With dead ends: 29197 [2018-10-26 19:26:22,614 INFO L226 Difference]: Without dead ends: 19723 [2018-10-26 19:26:22,625 INFO L605 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-10-26 19:26:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2018-10-26 19:26:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19721. [2018-10-26 19:26:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19721 states. [2018-10-26 19:26:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19721 states to 19721 states and 26887 transitions. [2018-10-26 19:26:22,950 INFO L78 Accepts]: Start accepts. Automaton has 19721 states and 26887 transitions. Word has length 33 [2018-10-26 19:26:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:22,950 INFO L481 AbstractCegarLoop]: Abstraction has 19721 states and 26887 transitions. [2018-10-26 19:26:22,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19721 states and 26887 transitions. [2018-10-26 19:26:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:26:22,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:22,961 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-10-26 19:26:22,961 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:22,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1685588442, now seen corresponding path program 1 times [2018-10-26 19:26:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:22,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:22,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:23,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:23,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:23,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:23,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:23,024 INFO L87 Difference]: Start difference. First operand 19721 states and 26887 transitions. Second operand 3 states. [2018-10-26 19:26:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:23,482 INFO L93 Difference]: Finished difference Result 33805 states and 46857 transitions. [2018-10-26 19:26:23,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:23,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:26:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:23,517 INFO L225 Difference]: With dead ends: 33805 [2018-10-26 19:26:23,517 INFO L226 Difference]: Without dead ends: 33803 [2018-10-26 19:26:23,527 INFO L605 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-10-26 19:26:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2018-10-26 19:26:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 29193. [2018-10-26 19:26:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2018-10-26 19:26:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 38663 transitions. [2018-10-26 19:26:24,104 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 38663 transitions. Word has length 33 [2018-10-26 19:26:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:24,104 INFO L481 AbstractCegarLoop]: Abstraction has 29193 states and 38663 transitions. [2018-10-26 19:26:24,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 38663 transitions. [2018-10-26 19:26:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:26:24,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:24,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] [2018-10-26 19:26:24,118 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:24,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1588310500, now seen corresponding path program 1 times [2018-10-26 19:26:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:24,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:24,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:24,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:24,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:24,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:24,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:24,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:24,196 INFO L87 Difference]: Start difference. First operand 29193 states and 38663 transitions. Second operand 3 states. [2018-10-26 19:26:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:24,516 INFO L93 Difference]: Finished difference Result 67085 states and 88841 transitions. [2018-10-26 19:26:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:24,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:26:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:24,553 INFO L225 Difference]: With dead ends: 67085 [2018-10-26 19:26:24,554 INFO L226 Difference]: Without dead ends: 38411 [2018-10-26 19:26:24,588 INFO L605 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-10-26 19:26:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38411 states. [2018-10-26 19:26:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38411 to 38409. [2018-10-26 19:26:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38409 states. [2018-10-26 19:26:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38409 states to 38409 states and 50183 transitions. [2018-10-26 19:26:25,279 INFO L78 Accepts]: Start accepts. Automaton has 38409 states and 50183 transitions. Word has length 33 [2018-10-26 19:26:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:25,279 INFO L481 AbstractCegarLoop]: Abstraction has 38409 states and 50183 transitions. [2018-10-26 19:26:25,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38409 states and 50183 transitions. [2018-10-26 19:26:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:26:25,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:25,291 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-10-26 19:26:25,291 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:25,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash -713418672, now seen corresponding path program 1 times [2018-10-26 19:26:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:25,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:25,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:25,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:25,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:25,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:25,368 INFO L87 Difference]: Start difference. First operand 38409 states and 50183 transitions. Second operand 3 states. [2018-10-26 19:26:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:25,713 INFO L93 Difference]: Finished difference Result 57613 states and 75017 transitions. [2018-10-26 19:26:25,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:25,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:26:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:25,753 INFO L225 Difference]: With dead ends: 57613 [2018-10-26 19:26:25,753 INFO L226 Difference]: Without dead ends: 38923 [2018-10-26 19:26:25,774 INFO L605 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-10-26 19:26:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38923 states. [2018-10-26 19:26:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38923 to 38921. [2018-10-26 19:26:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38921 states. [2018-10-26 19:26:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38921 states to 38921 states and 50183 transitions. [2018-10-26 19:26:26,618 INFO L78 Accepts]: Start accepts. Automaton has 38921 states and 50183 transitions. Word has length 34 [2018-10-26 19:26:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:26,618 INFO L481 AbstractCegarLoop]: Abstraction has 38921 states and 50183 transitions. [2018-10-26 19:26:26,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 38921 states and 50183 transitions. [2018-10-26 19:26:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:26:26,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:26,634 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-10-26 19:26:26,635 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:26,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1993200722, now seen corresponding path program 1 times [2018-10-26 19:26:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:26,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:26,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:26,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:26,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:26,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:26,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:26,700 INFO L87 Difference]: Start difference. First operand 38921 states and 50183 transitions. Second operand 3 states. [2018-10-26 19:26:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:27,263 INFO L93 Difference]: Finished difference Result 65549 states and 85513 transitions. [2018-10-26 19:26:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:27,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:26:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:27,315 INFO L225 Difference]: With dead ends: 65549 [2018-10-26 19:26:27,315 INFO L226 Difference]: Without dead ends: 65547 [2018-10-26 19:26:27,327 INFO L605 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-10-26 19:26:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65547 states. [2018-10-26 19:26:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65547 to 58377. [2018-10-26 19:26:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58377 states. [2018-10-26 19:26:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58377 states to 58377 states and 73223 transitions. [2018-10-26 19:26:28,266 INFO L78 Accepts]: Start accepts. Automaton has 58377 states and 73223 transitions. Word has length 34 [2018-10-26 19:26:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:28,266 INFO L481 AbstractCegarLoop]: Abstraction has 58377 states and 73223 transitions. [2018-10-26 19:26:28,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 58377 states and 73223 transitions. [2018-10-26 19:26:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:26:28,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:28,301 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-10-26 19:26:28,301 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:28,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 972132368, now seen corresponding path program 1 times [2018-10-26 19:26:28,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:28,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:28,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:28,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:28,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:28,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:28,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:28,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:28,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:28,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:28,352 INFO L87 Difference]: Start difference. First operand 58377 states and 73223 transitions. Second operand 3 states. [2018-10-26 19:26:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:28,995 INFO L93 Difference]: Finished difference Result 133133 states and 166409 transitions. [2018-10-26 19:26:28,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:28,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:26:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:29,060 INFO L225 Difference]: With dead ends: 133133 [2018-10-26 19:26:29,060 INFO L226 Difference]: Without dead ends: 75787 [2018-10-26 19:26:29,099 INFO L605 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-10-26 19:26:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2018-10-26 19:26:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 75785. [2018-10-26 19:26:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75785 states. [2018-10-26 19:26:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75785 states to 75785 states and 93191 transitions. [2018-10-26 19:26:30,512 INFO L78 Accepts]: Start accepts. Automaton has 75785 states and 93191 transitions. Word has length 34 [2018-10-26 19:26:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:30,512 INFO L481 AbstractCegarLoop]: Abstraction has 75785 states and 93191 transitions. [2018-10-26 19:26:30,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 75785 states and 93191 transitions. [2018-10-26 19:26:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 19:26:30,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:30,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, 1, 1, 1, 1] [2018-10-26 19:26:30,539 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:30,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1659896057, now seen corresponding path program 1 times [2018-10-26 19:26:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:30,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:30,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:30,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:30,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:30,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:30,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:30,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:30,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:30,611 INFO L87 Difference]: Start difference. First operand 75785 states and 93191 transitions. Second operand 3 states. [2018-10-26 19:26:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:31,259 INFO L93 Difference]: Finished difference Result 113677 states and 139273 transitions. [2018-10-26 19:26:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:31,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-26 19:26:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:31,322 INFO L225 Difference]: With dead ends: 113677 [2018-10-26 19:26:31,322 INFO L226 Difference]: Without dead ends: 76811 [2018-10-26 19:26:31,349 INFO L605 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-10-26 19:26:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76811 states. [2018-10-26 19:26:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76811 to 76809. [2018-10-26 19:26:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76809 states. [2018-10-26 19:26:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76809 states to 76809 states and 93191 transitions. [2018-10-26 19:26:32,871 INFO L78 Accepts]: Start accepts. Automaton has 76809 states and 93191 transitions. Word has length 35 [2018-10-26 19:26:32,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:32,871 INFO L481 AbstractCegarLoop]: Abstraction has 76809 states and 93191 transitions. [2018-10-26 19:26:32,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76809 states and 93191 transitions. [2018-10-26 19:26:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 19:26:32,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:32,897 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-10-26 19:26:32,898 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:32,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 71548155, now seen corresponding path program 1 times [2018-10-26 19:26:32,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:32,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:32,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:32,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:32,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:32,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:32,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:32,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:32,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:32,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:32,976 INFO L87 Difference]: Start difference. First operand 76809 states and 93191 transitions. Second operand 3 states. [2018-10-26 19:26:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:36,180 INFO L93 Difference]: Finished difference Result 126989 states and 154633 transitions. [2018-10-26 19:26:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:36,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-26 19:26:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:36,273 INFO L225 Difference]: With dead ends: 126989 [2018-10-26 19:26:36,274 INFO L226 Difference]: Without dead ends: 126987 [2018-10-26 19:26:36,284 INFO L605 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-10-26 19:26:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126987 states. [2018-10-26 19:26:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126987 to 116745. [2018-10-26 19:26:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116745 states. [2018-10-26 19:26:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116745 states to 116745 states and 138247 transitions. [2018-10-26 19:26:37,465 INFO L78 Accepts]: Start accepts. Automaton has 116745 states and 138247 transitions. Word has length 35 [2018-10-26 19:26:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:37,466 INFO L481 AbstractCegarLoop]: Abstraction has 116745 states and 138247 transitions. [2018-10-26 19:26:37,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 116745 states and 138247 transitions. [2018-10-26 19:26:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 19:26:37,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:37,510 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-10-26 19:26:37,510 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:37,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash -949520199, now seen corresponding path program 1 times [2018-10-26 19:26:37,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:37,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:37,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:37,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:37,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:37,583 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:37,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:37,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:37,584 INFO L87 Difference]: Start difference. First operand 116745 states and 138247 transitions. Second operand 3 states. [2018-10-26 19:26:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:39,369 INFO L93 Difference]: Finished difference Result 264205 states and 310281 transitions. [2018-10-26 19:26:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:39,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-26 19:26:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:39,469 INFO L225 Difference]: With dead ends: 264205 [2018-10-26 19:26:39,469 INFO L226 Difference]: Without dead ends: 149515 [2018-10-26 19:26:39,522 INFO L605 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-10-26 19:26:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149515 states. [2018-10-26 19:26:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149515 to 149513. [2018-10-26 19:26:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149513 states. [2018-10-26 19:26:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149513 states to 149513 states and 172039 transitions. [2018-10-26 19:26:42,075 INFO L78 Accepts]: Start accepts. Automaton has 149513 states and 172039 transitions. Word has length 35 [2018-10-26 19:26:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:42,076 INFO L481 AbstractCegarLoop]: Abstraction has 149513 states and 172039 transitions. [2018-10-26 19:26:42,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 149513 states and 172039 transitions. [2018-10-26 19:26:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:26:42,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:42,124 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-10-26 19:26:42,124 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:42,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2076758331, now seen corresponding path program 1 times [2018-10-26 19:26:42,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:42,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:42,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:42,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:42,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:42,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:42,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:42,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:42,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:42,180 INFO L87 Difference]: Start difference. First operand 149513 states and 172039 transitions. Second operand 3 states. [2018-10-26 19:26:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:43,560 INFO L93 Difference]: Finished difference Result 224269 states and 257033 transitions. [2018-10-26 19:26:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:43,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:26:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:43,716 INFO L225 Difference]: With dead ends: 224269 [2018-10-26 19:26:43,716 INFO L226 Difference]: Without dead ends: 151563 [2018-10-26 19:26:43,770 INFO L605 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-10-26 19:26:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-10-26 19:26:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 151561. [2018-10-26 19:26:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-10-26 19:26:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 172039 transitions. [2018-10-26 19:26:46,267 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 172039 transitions. Word has length 36 [2018-10-26 19:26:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:46,268 INFO L481 AbstractCegarLoop]: Abstraction has 151561 states and 172039 transitions. [2018-10-26 19:26:46,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 172039 transitions. [2018-10-26 19:26:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:26:46,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:46,320 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-10-26 19:26:46,320 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:46,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash 629861063, now seen corresponding path program 1 times [2018-10-26 19:26:46,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:46,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:46,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:46,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:46,321 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:46,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:46,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:46,348 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:46,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:46,348 INFO L87 Difference]: Start difference. First operand 151561 states and 172039 transitions. Second operand 3 states. [2018-10-26 19:26:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:49,019 INFO L93 Difference]: Finished difference Result 442379 states and 491528 transitions. [2018-10-26 19:26:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:49,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:26:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:49,190 INFO L225 Difference]: With dead ends: 442379 [2018-10-26 19:26:49,190 INFO L226 Difference]: Without dead ends: 151561 [2018-10-26 19:26:49,365 INFO L605 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-10-26 19:26:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151561 states. [2018-10-26 19:26:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151561 to 151561. [2018-10-26 19:26:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-10-26 19:26:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 163847 transitions. [2018-10-26 19:26:52,120 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 163847 transitions. Word has length 36 [2018-10-26 19:26:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:52,120 INFO L481 AbstractCegarLoop]: Abstraction has 151561 states and 163847 transitions. [2018-10-26 19:26:52,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 163847 transitions. [2018-10-26 19:26:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:26:52,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:52,177 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-10-26 19:26:52,177 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:52,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1650929417, now seen corresponding path program 1 times [2018-10-26 19:26:52,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:26:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:52,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:52,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:26:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:52,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:52,210 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:26:52,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:52,211 INFO L87 Difference]: Start difference. First operand 151561 states and 163847 transitions. Second operand 3 states. [2018-10-26 19:26:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:53,383 INFO L93 Difference]: Finished difference Result 151561 states and 163847 transitions. [2018-10-26 19:26:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:53,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:26:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:53,383 INFO L225 Difference]: With dead ends: 151561 [2018-10-26 19:26:53,384 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:26:53,477 INFO L605 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-10-26 19:26:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:26:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:26:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:26:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:26:53,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-10-26 19:26:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:53,479 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:26:53,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:26:53,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:26:53,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:26:53,616 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 19:26:53,616 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:26:53,616 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:26:53,616 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:26:53,616 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:26:53,616 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L428 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,617 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,618 INFO L428 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-10-26 19:26:53,618 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L421 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-26 19:26:53,619 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,620 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-10-26 19:26:53,620 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-26 19:26:53,620 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,620 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,620 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-10-26 19:26:53,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:26:53 BoogieIcfgContainer [2018-10-26 19:26:53,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:26:53,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:26:53,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:26:53,638 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:26:53,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:26:14" (3/4) ... [2018-10-26 19:26:53,641 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:26:53,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:26:53,658 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:26:53,664 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 19:26:53,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 19:26:53,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:26:53,728 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_75cb7bda-20e7-4ee6-916a-e3b3e599f544/bin-2019/utaipan/witness.graphml [2018-10-26 19:26:53,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:26:53,729 INFO L168 Benchmark]: Toolchain (without parser) took 39712.81 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-10-26 19:26:53,730 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:26:53,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.90 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:53,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.17 ms. Allocated memory is still 1.0 GB. Free memory was 943.5 MB in the beginning and 940.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:53,731 INFO L168 Benchmark]: Boogie Preprocessor took 24.27 ms. Allocated memory is still 1.0 GB. Free memory is still 940.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:26:53,731 INFO L168 Benchmark]: RCFGBuilder took 688.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:26:53,732 INFO L168 Benchmark]: TraceAbstraction took 38693.80 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.7 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-10-26 19:26:53,732 INFO L168 Benchmark]: Witness Printer took 91.09 ms. Allocated memory is still 5.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 689.6 kB). Peak memory consumption was 689.6 kB. Max. memory is 11.5 GB. [2018-10-26 19:26:53,738 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 192.90 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.17 ms. Allocated memory is still 1.0 GB. Free memory was 943.5 MB in the beginning and 940.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.27 ms. Allocated memory is still 1.0 GB. Free memory is still 940.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 688.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38693.80 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.7 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 91.09 ms. Allocated memory is still 5.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 689.6 kB). Peak memory consumption was 689.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: 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, 54 locations, 1 error locations. SAFE Result, 38.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4036 SDtfs, 2016 SDslu, 2748 SDs, 0 SdLazy, 195 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151561occurred in iteration=35, 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: 17.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 28711 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 65104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...