./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/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_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/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-1dbac8b [2018-10-26 19:38:49,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:38:49,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:38:49,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:38:49,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:38:49,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:38:49,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:38:49,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:38:49,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:38:49,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:38:49,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:38:49,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:38:49,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:38:49,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:38:49,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:38:49,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:38:49,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:38:49,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:38:49,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:38:49,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:38:49,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:38:49,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:38:49,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:38:49,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:38:49,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:38:49,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:38:49,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:38:49,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:38:49,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:38:49,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:38:49,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:38:49,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:38:49,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:38:49,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:38:49,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:38:49,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:38:49,648 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:38:49,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:38:49,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:38:49,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:38:49,661 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:38:49,661 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:38:49,662 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:38:49,662 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:38:49,662 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:38:49,662 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:38:49,662 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:38:49,663 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:38:49,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:38:49,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:38:49,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:38:49,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:38:49,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:38:49,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:38:49,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:38:49,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:38:49,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:38:49,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:38:49,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:38:49,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:38:49,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:38:49,668 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:38:49,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:38:49,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:38:49,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:38:49,668 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_d52c1c39-a058-4d42-99c6-30a90f8f46f1/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-10-26 19:38:49,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:38:49,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:38:49,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:38:49,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:38:49,711 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:38:49,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:38:49,757 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/data/4165ec606/aa2ee63e019d485590e1c8f32c38cebb/FLAGc86cbd06b [2018-10-26 19:38:50,128 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:38:50,129 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:38:50,136 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/data/4165ec606/aa2ee63e019d485590e1c8f32c38cebb/FLAGc86cbd06b [2018-10-26 19:38:50,147 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/data/4165ec606/aa2ee63e019d485590e1c8f32c38cebb [2018-10-26 19:38:50,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:38:50,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:38:50,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:38:50,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:38:50,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:38:50,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fd0115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50, skipping insertion in model container [2018-10-26 19:38:50,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:38:50,189 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:38:50,329 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:38:50,332 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:38:50,353 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:38:50,365 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:38:50,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50 WrapperNode [2018-10-26 19:38:50,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:38:50,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:38:50,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:38:50,366 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:38:50,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:38:50,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:38:50,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:38:50,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:38:50,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... [2018-10-26 19:38:50,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:38:50,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:38:50,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:38:50,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:38:50,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:38:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:38:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:38:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:38:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:38:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:38:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:38:51,043 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:38:51,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:38:51 BoogieIcfgContainer [2018-10-26 19:38:51,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:38:51,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:38:51,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:38:51,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:38:51,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:38:50" (1/3) ... [2018-10-26 19:38:51,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31588167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:38:51, skipping insertion in model container [2018-10-26 19:38:51,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:38:50" (2/3) ... [2018-10-26 19:38:51,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31588167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:38:51, skipping insertion in model container [2018-10-26 19:38:51,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:38:51" (3/3) ... [2018-10-26 19:38:51,052 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:38:51,060 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:38:51,066 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:38:51,076 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:38:51,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:38:51,103 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:38:51,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:38:51,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:38:51,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:38:51,104 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:38:51,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:38:51,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:38:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-26 19:38:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 19:38:51,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:51,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:51,129 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:51,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-10-26 19:38:51,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:51,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:51,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:51,325 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:51,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,343 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-10-26 19:38:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:51,458 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-10-26 19:38:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:51,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 19:38:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:51,472 INFO L225 Difference]: With dead ends: 89 [2018-10-26 19:38:51,472 INFO L226 Difference]: Without dead ends: 74 [2018-10-26 19:38:51,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-26 19:38:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-10-26 19:38:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 19:38:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-10-26 19:38:51,517 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-10-26 19:38:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:51,518 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-10-26 19:38:51,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-10-26 19:38:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 19:38:51,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:51,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:51,519 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:51,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-10-26 19:38:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:51,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:51,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:51,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:51,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:51,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:51,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,592 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-10-26 19:38:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:51,674 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-10-26 19:38:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:51,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 19:38:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:51,677 INFO L225 Difference]: With dead ends: 120 [2018-10-26 19:38:51,677 INFO L226 Difference]: Without dead ends: 74 [2018-10-26 19:38:51,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-26 19:38:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-26 19:38:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-26 19:38:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-10-26 19:38:51,685 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-10-26 19:38:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:51,685 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-10-26 19:38:51,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-10-26 19:38:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 19:38:51,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:51,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:51,691 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:51,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-10-26 19:38:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:51,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:51,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:51,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,770 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-10-26 19:38:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:51,807 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-10-26 19:38:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:51,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 19:38:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:51,810 INFO L225 Difference]: With dead ends: 112 [2018-10-26 19:38:51,810 INFO L226 Difference]: Without dead ends: 78 [2018-10-26 19:38:51,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-26 19:38:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-26 19:38:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-26 19:38:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-10-26 19:38:51,820 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-10-26 19:38:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:51,820 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-10-26 19:38:51,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-10-26 19:38:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 19:38:51,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:51,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:51,821 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:51,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-10-26 19:38:51,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:51,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:51,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:51,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:51,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:51,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:51,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:51,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,900 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-10-26 19:38:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:51,927 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-10-26 19:38:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:51,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 19:38:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:51,929 INFO L225 Difference]: With dead ends: 141 [2018-10-26 19:38:51,929 INFO L226 Difference]: Without dead ends: 139 [2018-10-26 19:38:51,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-26 19:38:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-10-26 19:38:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-26 19:38:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-10-26 19:38:51,943 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-10-26 19:38:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:51,944 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-10-26 19:38:51,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-10-26 19:38:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 19:38:51,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:51,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:51,945 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:51,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-10-26 19:38:51,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:51,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:51,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:51,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:51,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:51,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:51,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,000 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-10-26 19:38:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,072 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-10-26 19:38:52,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 19:38:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,074 INFO L225 Difference]: With dead ends: 231 [2018-10-26 19:38:52,074 INFO L226 Difference]: Without dead ends: 141 [2018-10-26 19:38:52,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-26 19:38:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-26 19:38:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 19:38:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-10-26 19:38:52,084 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-10-26 19:38:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,085 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-10-26 19:38:52,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-10-26 19:38:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:38:52,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,087 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-10-26 19:38:52,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,159 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,159 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-10-26 19:38:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,206 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-10-26 19:38:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 19:38:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,208 INFO L225 Difference]: With dead ends: 208 [2018-10-26 19:38:52,208 INFO L226 Difference]: Without dead ends: 143 [2018-10-26 19:38:52,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-26 19:38:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-26 19:38:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-26 19:38:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-10-26 19:38:52,217 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-10-26 19:38:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,218 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-10-26 19:38:52,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-10-26 19:38:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:38:52,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,220 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-10-26 19:38:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,301 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,301 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-10-26 19:38:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,353 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-10-26 19:38:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 19:38:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,354 INFO L225 Difference]: With dead ends: 261 [2018-10-26 19:38:52,354 INFO L226 Difference]: Without dead ends: 259 [2018-10-26 19:38:52,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-26 19:38:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-10-26 19:38:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-26 19:38:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-10-26 19:38:52,362 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-10-26 19:38:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,363 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-10-26 19:38:52,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-10-26 19:38:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:38:52,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,364 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,364 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-10-26 19:38:52,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,366 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,424 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,424 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-10-26 19:38:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,462 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-10-26 19:38:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 19:38:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,464 INFO L225 Difference]: With dead ends: 445 [2018-10-26 19:38:52,464 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 19:38:52,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 19:38:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-10-26 19:38:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-26 19:38:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-10-26 19:38:52,483 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-10-26 19:38:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,484 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-10-26 19:38:52,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-10-26 19:38:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:38:52,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,485 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-10-26 19:38:52,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,527 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-10-26 19:38:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,550 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-10-26 19:38:52,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:38:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,552 INFO L225 Difference]: With dead ends: 397 [2018-10-26 19:38:52,552 INFO L226 Difference]: Without dead ends: 271 [2018-10-26 19:38:52,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-26 19:38:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-26 19:38:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-26 19:38:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-10-26 19:38:52,563 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-10-26 19:38:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,565 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-10-26 19:38:52,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-10-26 19:38:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:38:52,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,566 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-10-26 19:38:52,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,607 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,608 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-10-26 19:38:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,642 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-10-26 19:38:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:38:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,644 INFO L225 Difference]: With dead ends: 493 [2018-10-26 19:38:52,644 INFO L226 Difference]: Without dead ends: 491 [2018-10-26 19:38:52,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-26 19:38:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-10-26 19:38:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-26 19:38:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-10-26 19:38:52,652 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-10-26 19:38:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,652 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-10-26 19:38:52,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-10-26 19:38:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:38:52,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,654 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-10-26 19:38:52,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,697 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-10-26 19:38:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,763 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-10-26 19:38:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:38:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,765 INFO L225 Difference]: With dead ends: 869 [2018-10-26 19:38:52,765 INFO L226 Difference]: Without dead ends: 515 [2018-10-26 19:38:52,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-26 19:38:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-10-26 19:38:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-26 19:38:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-10-26 19:38:52,782 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-10-26 19:38:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,782 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-10-26 19:38:52,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-10-26 19:38:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:38:52,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,783 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-10-26 19:38:52,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:52,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:52,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:52,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:52,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,853 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-10-26 19:38:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:52,944 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-10-26 19:38:52,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:52,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:38:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:52,948 INFO L225 Difference]: With dead ends: 769 [2018-10-26 19:38:52,948 INFO L226 Difference]: Without dead ends: 523 [2018-10-26 19:38:52,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-10-26 19:38:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-10-26 19:38:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-10-26 19:38:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-10-26 19:38:52,968 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-10-26 19:38:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:52,968 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-10-26 19:38:52,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-10-26 19:38:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:38:52,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:52,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:52,969 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:52,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-10-26 19:38:52,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:52,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:53,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:53,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:53,056 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:53,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:53,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:53,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,056 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-10-26 19:38:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:53,145 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-10-26 19:38:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:53,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:38:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:53,149 INFO L225 Difference]: With dead ends: 1501 [2018-10-26 19:38:53,149 INFO L226 Difference]: Without dead ends: 1003 [2018-10-26 19:38:53,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-26 19:38:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-10-26 19:38:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-10-26 19:38:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-10-26 19:38:53,182 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-10-26 19:38:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:53,183 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-10-26 19:38:53,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-10-26 19:38:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:38:53,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:53,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:53,184 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:53,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-10-26 19:38:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:53,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:53,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:53,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:53,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,260 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-10-26 19:38:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:53,352 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-10-26 19:38:53,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:53,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:38:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:53,357 INFO L225 Difference]: With dead ends: 1213 [2018-10-26 19:38:53,357 INFO L226 Difference]: Without dead ends: 1211 [2018-10-26 19:38:53,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-10-26 19:38:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-10-26 19:38:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-10-26 19:38:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-10-26 19:38:53,389 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-10-26 19:38:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:53,390 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-10-26 19:38:53,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-10-26 19:38:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:38:53,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:53,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:53,392 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:53,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-10-26 19:38:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:53,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:53,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:53,471 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:53,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,472 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-10-26 19:38:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:53,574 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-10-26 19:38:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:53,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:38:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:53,580 INFO L225 Difference]: With dead ends: 1789 [2018-10-26 19:38:53,580 INFO L226 Difference]: Without dead ends: 1787 [2018-10-26 19:38:53,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-10-26 19:38:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-10-26 19:38:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-10-26 19:38:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-10-26 19:38:53,626 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-10-26 19:38:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:53,626 INFO L481 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-10-26 19:38:53,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-10-26 19:38:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:38:53,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:53,628 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:53,628 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:53,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-10-26 19:38:53,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:53,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:53,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:53,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:53,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:53,695 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:53,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:53,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,696 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-10-26 19:38:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:53,827 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-10-26 19:38:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:53,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:38:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:53,833 INFO L225 Difference]: With dead ends: 3357 [2018-10-26 19:38:53,833 INFO L226 Difference]: Without dead ends: 1947 [2018-10-26 19:38:53,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-10-26 19:38:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-10-26 19:38:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-10-26 19:38:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-10-26 19:38:53,894 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-10-26 19:38:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:53,895 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-10-26 19:38:53,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-10-26 19:38:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:38:53,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:53,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:53,897 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:53,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-10-26 19:38:53,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:53,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:53,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:53,947 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:53,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:53,948 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-10-26 19:38:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:54,053 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-10-26 19:38:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:54,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:38:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:54,058 INFO L225 Difference]: With dead ends: 2941 [2018-10-26 19:38:54,058 INFO L226 Difference]: Without dead ends: 1995 [2018-10-26 19:38:54,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-26 19:38:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-10-26 19:38:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-10-26 19:38:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-10-26 19:38:54,120 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-10-26 19:38:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:54,120 INFO L481 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-10-26 19:38:54,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-10-26 19:38:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:38:54,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:54,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:54,123 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:54,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-10-26 19:38:54,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:54,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:54,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:54,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:54,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:54,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:54,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:54,188 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:54,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,189 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-10-26 19:38:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:54,319 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-10-26 19:38:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:54,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:38:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:54,329 INFO L225 Difference]: With dead ends: 3469 [2018-10-26 19:38:54,329 INFO L226 Difference]: Without dead ends: 3467 [2018-10-26 19:38:54,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-10-26 19:38:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-10-26 19:38:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-10-26 19:38:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-10-26 19:38:54,429 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-10-26 19:38:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:54,429 INFO L481 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-10-26 19:38:54,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-10-26 19:38:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:38:54,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:54,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:54,436 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:54,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-10-26 19:38:54,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:54,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:54,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:54,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:54,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:54,499 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:54,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,500 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-10-26 19:38:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:54,647 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-10-26 19:38:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:54,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:38:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:54,658 INFO L225 Difference]: With dead ends: 6669 [2018-10-26 19:38:54,659 INFO L226 Difference]: Without dead ends: 3851 [2018-10-26 19:38:54,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-10-26 19:38:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-10-26 19:38:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-10-26 19:38:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-10-26 19:38:54,759 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-10-26 19:38:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:54,759 INFO L481 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-10-26 19:38:54,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-10-26 19:38:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:38:54,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:54,764 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:54,764 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:54,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-10-26 19:38:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:54,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:54,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:54,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:54,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:54,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:54,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:54,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:54,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,832 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-10-26 19:38:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:54,968 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-10-26 19:38:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:54,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:38:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:54,977 INFO L225 Difference]: With dead ends: 5773 [2018-10-26 19:38:54,977 INFO L226 Difference]: Without dead ends: 3915 [2018-10-26 19:38:54,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-10-26 19:38:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-10-26 19:38:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-10-26 19:38:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-10-26 19:38:55,081 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-10-26 19:38:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:55,081 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-10-26 19:38:55,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-10-26 19:38:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:38:55,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:55,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:55,085 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:55,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-10-26 19:38:55,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:55,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:55,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:55,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:55,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:55,151 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:55,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:55,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:55,152 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-10-26 19:38:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:55,327 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-10-26 19:38:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:55,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:38:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:55,345 INFO L225 Difference]: With dead ends: 6669 [2018-10-26 19:38:55,345 INFO L226 Difference]: Without dead ends: 6667 [2018-10-26 19:38:55,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-10-26 19:38:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-10-26 19:38:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-10-26 19:38:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-10-26 19:38:55,476 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-10-26 19:38:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:55,476 INFO L481 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-10-26 19:38:55,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-10-26 19:38:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:38:55,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:55,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:55,484 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:55,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-10-26 19:38:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:55,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:55,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:55,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:55,559 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:55,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:55,560 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-10-26 19:38:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:55,762 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-10-26 19:38:55,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:55,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:38:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:55,785 INFO L225 Difference]: With dead ends: 13197 [2018-10-26 19:38:55,785 INFO L226 Difference]: Without dead ends: 7563 [2018-10-26 19:38:55,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-10-26 19:38:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-10-26 19:38:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-10-26 19:38:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-10-26 19:38:56,026 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-10-26 19:38:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:56,026 INFO L481 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-10-26 19:38:56,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-10-26 19:38:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:38:56,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:56,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:56,033 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:56,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-10-26 19:38:56,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:56,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:56,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:56,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:56,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:56,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:56,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:56,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:56,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:56,104 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-10-26 19:38:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:56,295 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-10-26 19:38:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:56,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:38:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:56,314 INFO L225 Difference]: With dead ends: 11341 [2018-10-26 19:38:56,314 INFO L226 Difference]: Without dead ends: 7691 [2018-10-26 19:38:56,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2018-10-26 19:38:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7689. [2018-10-26 19:38:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-10-26 19:38:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 9735 transitions. [2018-10-26 19:38:56,484 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 9735 transitions. Word has length 29 [2018-10-26 19:38:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:56,484 INFO L481 AbstractCegarLoop]: Abstraction has 7689 states and 9735 transitions. [2018-10-26 19:38:56,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 9735 transitions. [2018-10-26 19:38:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:38:56,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:56,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:56,491 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:56,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash -7150161, now seen corresponding path program 1 times [2018-10-26 19:38:56,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:56,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:56,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:56,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:56,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:56,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:56,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:56,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:56,580 INFO L87 Difference]: Start difference. First operand 7689 states and 9735 transitions. Second operand 3 states. [2018-10-26 19:38:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:56,823 INFO L93 Difference]: Finished difference Result 12813 states and 16265 transitions. [2018-10-26 19:38:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:56,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:38:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:56,844 INFO L225 Difference]: With dead ends: 12813 [2018-10-26 19:38:56,844 INFO L226 Difference]: Without dead ends: 12811 [2018-10-26 19:38:56,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12811 states. [2018-10-26 19:38:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12811 to 11529. [2018-10-26 19:38:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-10-26 19:38:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 14215 transitions. [2018-10-26 19:38:57,051 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 14215 transitions. Word has length 29 [2018-10-26 19:38:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:57,051 INFO L481 AbstractCegarLoop]: Abstraction has 11529 states and 14215 transitions. [2018-10-26 19:38:57,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 14215 transitions. [2018-10-26 19:38:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:38:57,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:57,066 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:57,066 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:57,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash -593956175, now seen corresponding path program 1 times [2018-10-26 19:38:57,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:57,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:57,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:57,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:57,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:57,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:57,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:57,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:57,143 INFO L87 Difference]: Start difference. First operand 11529 states and 14215 transitions. Second operand 3 states. [2018-10-26 19:38:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:57,482 INFO L93 Difference]: Finished difference Result 26125 states and 31881 transitions. [2018-10-26 19:38:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:57,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:38:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:57,501 INFO L225 Difference]: With dead ends: 26125 [2018-10-26 19:38:57,501 INFO L226 Difference]: Without dead ends: 14859 [2018-10-26 19:38:57,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2018-10-26 19:38:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14857. [2018-10-26 19:38:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2018-10-26 19:38:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 17671 transitions. [2018-10-26 19:38:57,808 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 17671 transitions. Word has length 29 [2018-10-26 19:38:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:57,809 INFO L481 AbstractCegarLoop]: Abstraction has 14857 states and 17671 transitions. [2018-10-26 19:38:57,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 17671 transitions. [2018-10-26 19:38:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:38:57,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:57,820 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:57,821 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:57,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -221438882, now seen corresponding path program 1 times [2018-10-26 19:38:57,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:57,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:57,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:57,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:57,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:57,892 INFO L87 Difference]: Start difference. First operand 14857 states and 17671 transitions. Second operand 3 states. [2018-10-26 19:38:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:58,112 INFO L93 Difference]: Finished difference Result 22285 states and 26377 transitions. [2018-10-26 19:38:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:58,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:38:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:58,126 INFO L225 Difference]: With dead ends: 22285 [2018-10-26 19:38:58,127 INFO L226 Difference]: Without dead ends: 15115 [2018-10-26 19:38:58,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2018-10-26 19:38:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 15113. [2018-10-26 19:38:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15113 states. [2018-10-26 19:38:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15113 states to 15113 states and 17671 transitions. [2018-10-26 19:38:58,446 INFO L78 Accepts]: Start accepts. Automaton has 15113 states and 17671 transitions. Word has length 30 [2018-10-26 19:38:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:58,447 INFO L481 AbstractCegarLoop]: Abstraction has 15113 states and 17671 transitions. [2018-10-26 19:38:58,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15113 states and 17671 transitions. [2018-10-26 19:38:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:38:58,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:58,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:58,457 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:58,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1232556132, now seen corresponding path program 1 times [2018-10-26 19:38:58,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:58,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:58,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:58,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:58,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:58,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:58,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:58,522 INFO L87 Difference]: Start difference. First operand 15113 states and 17671 transitions. Second operand 3 states. [2018-10-26 19:38:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:58,764 INFO L93 Difference]: Finished difference Result 24587 states and 28424 transitions. [2018-10-26 19:38:58,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:58,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:38:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:58,784 INFO L225 Difference]: With dead ends: 24587 [2018-10-26 19:38:58,784 INFO L226 Difference]: Without dead ends: 24585 [2018-10-26 19:38:58,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24585 states. [2018-10-26 19:38:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24585 to 23049. [2018-10-26 19:38:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23049 states. [2018-10-26 19:38:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23049 states to 23049 states and 26375 transitions. [2018-10-26 19:38:59,089 INFO L78 Accepts]: Start accepts. Automaton has 23049 states and 26375 transitions. Word has length 30 [2018-10-26 19:38:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:59,090 INFO L481 AbstractCegarLoop]: Abstraction has 23049 states and 26375 transitions. [2018-10-26 19:38:59,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 23049 states and 26375 transitions. [2018-10-26 19:38:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:38:59,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:59,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:59,102 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:59,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1819362146, now seen corresponding path program 1 times [2018-10-26 19:38:59,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:38:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:59,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:59,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:38:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:38:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:38:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:38:59,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:38:59,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:38:59,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:38:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:59,158 INFO L87 Difference]: Start difference. First operand 23049 states and 26375 transitions. Second operand 3 states. [2018-10-26 19:38:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:59,567 INFO L93 Difference]: Finished difference Result 51721 states and 58119 transitions. [2018-10-26 19:38:59,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:59,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:38:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:59,568 INFO L225 Difference]: With dead ends: 51721 [2018-10-26 19:38:59,568 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:38:59,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:38:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:38:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:38:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:38:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:38:59,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-10-26 19:38:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:59,611 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:38:59,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:38:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:38:59,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:38:59,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:38:59,712 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 19:38:59,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:38:59,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:38:59,712 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:38:59,712 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:38:59,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:38:59,712 INFO L428 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-10-26 19:38:59,712 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-10-26 19:38:59,712 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L428 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-10-26 19:38:59,713 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L421 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-26 19:38:59,714 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,715 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-26 19:38:59,715 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-10-26 19:38:59,715 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,715 INFO L425 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-10-26 19:38:59,715 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 19:38:59,715 INFO L425 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-10-26 19:38:59,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:38:59 BoogieIcfgContainer [2018-10-26 19:38:59,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:38:59,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:38:59,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:38:59,723 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:38:59,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:38:51" (3/4) ... [2018-10-26 19:38:59,728 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:38:59,733 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:38:59,734 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:38:59,738 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 19:38:59,738 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 19:38:59,739 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:38:59,789 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d52c1c39-a058-4d42-99c6-30a90f8f46f1/bin-2019/utaipan/witness.graphml [2018-10-26 19:38:59,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:38:59,790 INFO L168 Benchmark]: Toolchain (without parser) took 9640.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.1 MB). Free memory was 954.4 MB in the beginning and 1.3 GB in the end (delta: -303.0 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:38:59,791 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:38:59,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.14 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:38:59,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:38:59,792 INFO L168 Benchmark]: Boogie Preprocessor took 23.01 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:38:59,792 INFO L168 Benchmark]: RCFGBuilder took 637.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -235.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:38:59,793 INFO L168 Benchmark]: TraceAbstraction took 8677.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.8 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -94.5 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:38:59,793 INFO L168 Benchmark]: Witness Printer took 66.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:38:59,799 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.14 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.01 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 637.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -235.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8677.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.8 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -94.5 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. * Witness Printer took 66.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 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, 45 locations, 1 error locations. SAFE Result, 8.6s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 1178 SDslu, 1649 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23049occurred 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: 2.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 5147 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.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 33520 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...