./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/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 0f7b0b589689413087c164ce10eb80c902ee4046 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:45:36,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:45:36,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:45:36,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:45:36,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:45:36,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:45:36,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:45:36,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:45:36,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:45:36,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:45:36,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:45:36,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:45:36,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:45:36,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:45:36,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:45:36,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:45:36,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:45:36,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:45:36,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:45:36,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:45:36,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:45:36,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:45:36,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:45:36,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:45:36,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:45:36,593 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:45:36,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:45:36,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:45:36,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:45:36,595 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:45:36,595 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:45:36,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:45:36,596 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:45:36,596 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:45:36,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:45:36,597 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:45:36,597 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:45:36,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:45:36,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:45:36,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:45:36,607 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:45:36,607 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:45:36,607 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:45:36,607 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:45:36,607 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:45:36,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:45:36,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:45:36,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:45:36,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:45:36,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:45:36,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:45:36,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:45:36,610 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:45:36,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:45:36,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:45:36,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:45:36,610 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_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-12-09 00:45:36,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:45:36,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:45:36,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:45:36,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:45:36,641 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:45:36,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:45:36,674 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/data/472e04795/d151e1f317ed41c8b500ad94b189f395/FLAG6bf447dc8 [2018-12-09 00:45:36,979 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:45:36,979 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:45:36,984 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/data/472e04795/d151e1f317ed41c8b500ad94b189f395/FLAG6bf447dc8 [2018-12-09 00:45:36,992 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/data/472e04795/d151e1f317ed41c8b500ad94b189f395 [2018-12-09 00:45:36,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:45:36,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:45:36,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:45:36,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:45:36,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:45:36,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:45:36" (1/1) ... [2018-12-09 00:45:37,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:36, skipping insertion in model container [2018-12-09 00:45:37,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:45:36" (1/1) ... [2018-12-09 00:45:37,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:45:37,016 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:45:37,105 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:45:37,108 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:45:37,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:45:37,129 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:45:37,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37 WrapperNode [2018-12-09 00:45:37,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:45:37,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:45:37,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:45:37,130 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:45:37,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:45:37,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:45:37,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:45:37,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:45:37,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... [2018-12-09 00:45:37,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:45:37,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:45:37,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:45:37,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:45:37,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:45:37,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:45:37,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:45:37,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:45:37,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:45:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:45:37,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:45:37,372 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:45:37,372 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:45:37,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:45:37 BoogieIcfgContainer [2018-12-09 00:45:37,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:45:37,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:45:37,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:45:37,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:45:37,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:45:36" (1/3) ... [2018-12-09 00:45:37,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730b653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:45:37, skipping insertion in model container [2018-12-09 00:45:37,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:37" (2/3) ... [2018-12-09 00:45:37,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730b653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:45:37, skipping insertion in model container [2018-12-09 00:45:37,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:45:37" (3/3) ... [2018-12-09 00:45:37,377 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:45:37,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:45:37,386 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:45:37,395 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:45:37,414 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:45:37,414 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:45:37,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:45:37,414 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:45:37,415 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:45:37,415 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:45:37,415 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:45:37,415 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:45:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-09 00:45:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:45:37,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-12-09 00:45:37,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,543 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-12-09 00:45:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,569 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-12-09 00:45:37,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 00:45:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,577 INFO L225 Difference]: With dead ends: 87 [2018-12-09 00:45:37,577 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 00:45:37,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 00:45:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-12-09 00:45:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 00:45:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-12-09 00:45:37,602 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-12-09 00:45:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,602 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-12-09 00:45:37,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-12-09 00:45:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:45:37,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-12-09 00:45:37,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,632 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-12-09 00:45:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,650 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-12-09 00:45:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 00:45:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,651 INFO L225 Difference]: With dead ends: 117 [2018-12-09 00:45:37,651 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 00:45:37,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 00:45:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-12-09 00:45:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 00:45:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-12-09 00:45:37,657 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-12-09 00:45:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,657 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-12-09 00:45:37,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-12-09 00:45:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:45:37,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,658 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-12-09 00:45:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,682 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-12-09 00:45:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,692 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-12-09 00:45:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 00:45:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,693 INFO L225 Difference]: With dead ends: 108 [2018-12-09 00:45:37,693 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 00:45:37,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 00:45:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-09 00:45:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 00:45:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-12-09 00:45:37,700 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-12-09 00:45:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,700 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-12-09 00:45:37,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-12-09 00:45:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:45:37,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-12-09 00:45:37,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,727 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-12-09 00:45:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,738 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-12-09 00:45:37,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 00:45:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,740 INFO L225 Difference]: With dead ends: 136 [2018-12-09 00:45:37,740 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 00:45:37,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 00:45:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-12-09 00:45:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 00:45:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-12-09 00:45:37,748 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-12-09 00:45:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,748 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-12-09 00:45:37,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-12-09 00:45:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:45:37,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,749 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-12-09 00:45:37,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,771 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-12-09 00:45:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,785 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-12-09 00:45:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 00:45:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,786 INFO L225 Difference]: With dead ends: 224 [2018-12-09 00:45:37,786 INFO L226 Difference]: Without dead ends: 136 [2018-12-09 00:45:37,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-09 00:45:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-12-09 00:45:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 00:45:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-12-09 00:45:37,792 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-12-09 00:45:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,792 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-12-09 00:45:37,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-12-09 00:45:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:45:37,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,793 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-12-09 00:45:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,812 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-12-09 00:45:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,821 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-12-09 00:45:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 00:45:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,822 INFO L225 Difference]: With dead ends: 201 [2018-12-09 00:45:37,822 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 00:45:37,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 00:45:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-09 00:45:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-09 00:45:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-12-09 00:45:37,828 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-12-09 00:45:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,829 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-12-09 00:45:37,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-12-09 00:45:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:45:37,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,830 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-12-09 00:45:37,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,847 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-12-09 00:45:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,857 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-12-09 00:45:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 00:45:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,858 INFO L225 Difference]: With dead ends: 252 [2018-12-09 00:45:37,858 INFO L226 Difference]: Without dead ends: 250 [2018-12-09 00:45:37,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-09 00:45:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-12-09 00:45:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-09 00:45:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-12-09 00:45:37,864 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-12-09 00:45:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,865 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-12-09 00:45:37,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-12-09 00:45:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:45:37,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,865 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-12-09 00:45:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,878 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-12-09 00:45:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,888 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-12-09 00:45:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 00:45:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,889 INFO L225 Difference]: With dead ends: 432 [2018-12-09 00:45:37,889 INFO L226 Difference]: Without dead ends: 258 [2018-12-09 00:45:37,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-09 00:45:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-09 00:45:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 00:45:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-12-09 00:45:37,896 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-12-09 00:45:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,896 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-12-09 00:45:37,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-12-09 00:45:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:45:37,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,897 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-12-09 00:45:37,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,909 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-12-09 00:45:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,918 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-12-09 00:45:37,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 00:45:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,919 INFO L225 Difference]: With dead ends: 384 [2018-12-09 00:45:37,919 INFO L226 Difference]: Without dead ends: 262 [2018-12-09 00:45:37,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-09 00:45:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-12-09 00:45:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 00:45:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-12-09 00:45:37,924 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-12-09 00:45:37,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,925 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-12-09 00:45:37,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-12-09 00:45:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:45:37,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,925 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-12-09 00:45:37,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,937 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-12-09 00:45:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,949 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-12-09 00:45:37,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 00:45:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,951 INFO L225 Difference]: With dead ends: 476 [2018-12-09 00:45:37,951 INFO L226 Difference]: Without dead ends: 474 [2018-12-09 00:45:37,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-09 00:45:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-12-09 00:45:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-09 00:45:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-12-09 00:45:37,959 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-12-09 00:45:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,959 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-12-09 00:45:37,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-12-09 00:45:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:45:37,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,960 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-12-09 00:45:37,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:37,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:37,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:37,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,972 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-12-09 00:45:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:37,985 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-12-09 00:45:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:37,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 00:45:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:37,986 INFO L225 Difference]: With dead ends: 844 [2018-12-09 00:45:37,986 INFO L226 Difference]: Without dead ends: 498 [2018-12-09 00:45:37,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-09 00:45:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-12-09 00:45:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-09 00:45:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-12-09 00:45:37,997 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-12-09 00:45:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:37,997 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-12-09 00:45:37,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-12-09 00:45:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:45:37,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:37,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:37,998 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-12-09 00:45:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:37,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,015 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-12-09 00:45:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,026 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-12-09 00:45:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:45:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,027 INFO L225 Difference]: With dead ends: 744 [2018-12-09 00:45:38,027 INFO L226 Difference]: Without dead ends: 506 [2018-12-09 00:45:38,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-09 00:45:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-12-09 00:45:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-09 00:45:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-12-09 00:45:38,037 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-12-09 00:45:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,038 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-12-09 00:45:38,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-12-09 00:45:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:45:38,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-12-09 00:45:38,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,051 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-12-09 00:45:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,064 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-12-09 00:45:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:45:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,066 INFO L225 Difference]: With dead ends: 908 [2018-12-09 00:45:38,066 INFO L226 Difference]: Without dead ends: 906 [2018-12-09 00:45:38,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-12-09 00:45:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-12-09 00:45:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-09 00:45:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-12-09 00:45:38,080 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-12-09 00:45:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,080 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-12-09 00:45:38,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-12-09 00:45:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:45:38,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,081 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-12-09 00:45:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,092 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-12-09 00:45:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,111 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-12-09 00:45:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:45:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,113 INFO L225 Difference]: With dead ends: 1660 [2018-12-09 00:45:38,113 INFO L226 Difference]: Without dead ends: 970 [2018-12-09 00:45:38,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-09 00:45:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-12-09 00:45:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-09 00:45:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-12-09 00:45:38,132 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-12-09 00:45:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,132 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-12-09 00:45:38,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-12-09 00:45:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:45:38,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,133 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-12-09 00:45:38,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,146 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-12-09 00:45:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,167 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-12-09 00:45:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:45:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,169 INFO L225 Difference]: With dead ends: 1452 [2018-12-09 00:45:38,169 INFO L226 Difference]: Without dead ends: 986 [2018-12-09 00:45:38,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-09 00:45:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-12-09 00:45:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-12-09 00:45:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-12-09 00:45:38,188 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-12-09 00:45:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,188 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-12-09 00:45:38,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-12-09 00:45:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:45:38,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,190 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-12-09 00:45:38,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,202 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-12-09 00:45:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,228 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-12-09 00:45:38,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:45:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,231 INFO L225 Difference]: With dead ends: 1740 [2018-12-09 00:45:38,231 INFO L226 Difference]: Without dead ends: 1738 [2018-12-09 00:45:38,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-09 00:45:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-12-09 00:45:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-12-09 00:45:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-12-09 00:45:38,255 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-12-09 00:45:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,256 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-12-09 00:45:38,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-12-09 00:45:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:45:38,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,257 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-12-09 00:45:38,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,266 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-12-09 00:45:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,292 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-12-09 00:45:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:45:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,295 INFO L225 Difference]: With dead ends: 3276 [2018-12-09 00:45:38,295 INFO L226 Difference]: Without dead ends: 1898 [2018-12-09 00:45:38,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-09 00:45:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-12-09 00:45:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-12-09 00:45:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-12-09 00:45:38,334 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-12-09 00:45:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,334 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-12-09 00:45:38,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-12-09 00:45:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:45:38,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,335 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-12-09 00:45:38,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,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-12-09 00:45:38,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,348 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-12-09 00:45:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,395 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-12-09 00:45:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:45:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,401 INFO L225 Difference]: With dead ends: 2844 [2018-12-09 00:45:38,401 INFO L226 Difference]: Without dead ends: 1930 [2018-12-09 00:45:38,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-09 00:45:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-12-09 00:45:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-09 00:45:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-12-09 00:45:38,453 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-12-09 00:45:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,454 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-12-09 00:45:38,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-12-09 00:45:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:45:38,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,455 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-12-09 00:45:38,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,466 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-12-09 00:45:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,511 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-12-09 00:45:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:45:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,517 INFO L225 Difference]: With dead ends: 3340 [2018-12-09 00:45:38,517 INFO L226 Difference]: Without dead ends: 3338 [2018-12-09 00:45:38,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-09 00:45:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-12-09 00:45:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-12-09 00:45:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-12-09 00:45:38,570 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-12-09 00:45:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,571 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-12-09 00:45:38,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-12-09 00:45:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:45:38,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,573 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-12-09 00:45:38,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,590 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-12-09 00:45:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,657 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-12-09 00:45:38,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:45:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,667 INFO L225 Difference]: With dead ends: 6476 [2018-12-09 00:45:38,667 INFO L226 Difference]: Without dead ends: 3722 [2018-12-09 00:45:38,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-09 00:45:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-12-09 00:45:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-12-09 00:45:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-12-09 00:45:38,751 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-12-09 00:45:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,751 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-12-09 00:45:38,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-12-09 00:45:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:45:38,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,754 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-12-09 00:45:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,765 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-12-09 00:45:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:38,832 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-12-09 00:45:38,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:38,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:45:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:38,851 INFO L225 Difference]: With dead ends: 5580 [2018-12-09 00:45:38,851 INFO L226 Difference]: Without dead ends: 3786 [2018-12-09 00:45:38,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-12-09 00:45:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-12-09 00:45:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-09 00:45:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-12-09 00:45:38,915 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-12-09 00:45:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:38,915 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-12-09 00:45:38,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-12-09 00:45:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:45:38,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:38,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:38,918 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:38,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-12-09 00:45:38,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:38,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:38,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:38,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:38,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:38,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:38,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:38,935 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-12-09 00:45:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:39,020 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-12-09 00:45:39,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:39,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:45:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:39,032 INFO L225 Difference]: With dead ends: 10956 [2018-12-09 00:45:39,032 INFO L226 Difference]: Without dead ends: 7306 [2018-12-09 00:45:39,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-12-09 00:45:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-12-09 00:45:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-09 00:45:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-12-09 00:45:39,152 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-12-09 00:45:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:39,152 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-12-09 00:45:39,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-12-09 00:45:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:45:39,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:39,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:39,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:39,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-12-09 00:45:39,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:39,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:39,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:39,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:39,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:39,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:39,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:39,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,167 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-12-09 00:45:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:39,253 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-12-09 00:45:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:39,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:45:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:39,264 INFO L225 Difference]: With dead ends: 8076 [2018-12-09 00:45:39,265 INFO L226 Difference]: Without dead ends: 8074 [2018-12-09 00:45:39,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-09 00:45:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-12-09 00:45:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-09 00:45:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-12-09 00:45:39,376 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-12-09 00:45:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:39,376 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-12-09 00:45:39,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-12-09 00:45:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:45:39,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:39,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:39,381 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:39,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-12-09 00:45:39,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:39,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:39,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:39,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:39,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:39,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:39,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:39,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,391 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-12-09 00:45:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:39,531 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-12-09 00:45:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:39,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:45:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:39,543 INFO L225 Difference]: With dead ends: 12172 [2018-12-09 00:45:39,543 INFO L226 Difference]: Without dead ends: 12170 [2018-12-09 00:45:39,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-09 00:45:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-12-09 00:45:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-09 00:45:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-12-09 00:45:39,679 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-12-09 00:45:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:39,680 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-12-09 00:45:39,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-12-09 00:45:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:45:39,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:39,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:39,689 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:39,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:39,689 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-12-09 00:45:39,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:39,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:39,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:39,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:39,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:39,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:39,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:39,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:39,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,703 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-12-09 00:45:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:39,863 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-12-09 00:45:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:39,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:45:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:39,875 INFO L225 Difference]: With dead ends: 25228 [2018-12-09 00:45:39,875 INFO L226 Difference]: Without dead ends: 14218 [2018-12-09 00:45:39,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-12-09 00:45:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-12-09 00:45:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-09 00:45:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-12-09 00:45:40,075 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-12-09 00:45:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:40,075 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-12-09 00:45:40,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-12-09 00:45:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:45:40,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:40,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:40,080 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:40,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-12-09 00:45:40,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:40,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:40,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:40,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:40,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:40,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:40,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:40,094 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-12-09 00:45:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:40,216 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-12-09 00:45:40,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:40,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:45:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:40,228 INFO L225 Difference]: With dead ends: 21516 [2018-12-09 00:45:40,228 INFO L226 Difference]: Without dead ends: 14602 [2018-12-09 00:45:40,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-12-09 00:45:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-12-09 00:45:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-12-09 00:45:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-12-09 00:45:40,417 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-12-09 00:45:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:40,417 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-12-09 00:45:40,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-12-09 00:45:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:45:40,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:40,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:40,422 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:40,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-12-09 00:45:40,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:40,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:40,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:40,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:40,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:40,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:40,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:40,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:40,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:40,431 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-12-09 00:45:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:40,638 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-12-09 00:45:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:40,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:45:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:40,654 INFO L225 Difference]: With dead ends: 23562 [2018-12-09 00:45:40,655 INFO L226 Difference]: Without dead ends: 23560 [2018-12-09 00:45:40,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-12-09 00:45:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-12-09 00:45:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-12-09 00:45:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-12-09 00:45:40,878 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-12-09 00:45:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:40,878 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-12-09 00:45:40,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-12-09 00:45:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:45:40,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:40,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:40,888 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:40,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-12-09 00:45:40,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:45:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:40,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:40,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:45:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:40,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:40,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:40,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:45:40,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:40,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:40,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:40,898 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-12-09 00:45:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:41,152 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-12-09 00:45:41,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:41,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:45:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:41,153 INFO L225 Difference]: With dead ends: 50184 [2018-12-09 00:45:41,153 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:45:41,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:45:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:45:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:45:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:45:41,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-12-09 00:45:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:41,184 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:45:41,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:45:41,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:45:41,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:45:41,206 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 00:45:41,206 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:45:41,206 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:45:41,206 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:45:41,206 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-12-09 00:45:41,207 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-09 00:45:41,208 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-09 00:45:41,209 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-12-09 00:45:41,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:45:41 BoogieIcfgContainer [2018-12-09 00:45:41,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:45:41,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:45:41,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:45:41,214 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:45:41,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:45:37" (3/4) ... [2018-12-09 00:45:41,217 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:45:41,221 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:45:41,222 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:45:41,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 00:45:41,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:45:41,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:45:41,259 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd97dfb3-0661-47a7-8c9e-f04f28a5a59f/bin-2019/utaipan/witness.graphml [2018-12-09 00:45:41,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:45:41,260 INFO L168 Benchmark]: Toolchain (without parser) took 4264.71 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 578.3 MB). Free memory was 952.4 MB in the beginning and 953.2 MB in the end (delta: -830.7 kB). Peak memory consumption was 577.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,261 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:45:41,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.44 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,261 INFO L168 Benchmark]: Boogie Preprocessor took 22.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Free memory was 936.3 MB in the beginning and 1.0 GB in the end (delta: -89.1 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,261 INFO L168 Benchmark]: RCFGBuilder took 207.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,261 INFO L168 Benchmark]: TraceAbstraction took 3840.58 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 342.4 MB). Free memory was 1.2 GB in the beginning and 955.6 MB in the end (delta: 253.4 MB). Peak memory consumption was 595.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,262 INFO L168 Benchmark]: Witness Printer took 45.38 ms. Allocated memory is still 1.6 GB. Free memory was 955.6 MB in the beginning and 953.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:45:41,263 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.44 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Free memory was 936.3 MB in the beginning and 1.0 GB in the end (delta: -89.1 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 207.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3840.58 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 342.4 MB). Free memory was 1.2 GB in the beginning and 955.6 MB in the end (delta: 253.4 MB). Peak memory consumption was 595.7 MB. Max. memory is 11.5 GB. * Witness Printer took 45.38 ms. Allocated memory is still 1.6 GB. Free memory was 955.6 MB in the beginning and 953.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 1.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...