java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:54:46,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:54:46,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:54:46,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:54:46,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:54:46,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:54:46,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:54:46,296 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:54:46,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:54:46,299 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:54:46,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:54:46,300 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:54:46,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:54:46,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:54:46,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:54:46,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:54:46,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:54:46,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:54:46,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:54:46,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:54:46,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:54:46,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:54:46,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:54:46,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:54:46,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:54:46,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:54:46,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:54:46,319 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:54:46,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:54:46,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:54:46,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:54:46,321 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 19:54:46,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:54:46,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:54:46,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:54:46,331 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:54:46,331 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:54:46,331 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:54:46,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:54:46,331 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:54:46,331 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:54:46,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:54:46,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:54:46,332 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:54:46,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:54:46,332 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:54:46,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:54:46,332 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:54:46,333 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:54:46,333 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:54:46,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:54:46,333 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:54:46,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:54:46,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:54:46,334 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:54:46,334 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:54:46,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:54:46,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:54:46,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:54:46,334 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:54:46,335 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:54:46,336 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:54:46,336 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:54:46,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:54:46,378 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:54:46,381 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:54:46,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:54:46,383 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:54:46,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:54:46,540 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:54:46,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:54:46,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:54:46,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:54:46,552 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:54:46,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46, skipping insertion in model container [2018-01-24 19:54:46,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,569 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:54:46,607 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:54:46,727 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:54:46,746 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:54:46,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46 WrapperNode [2018-01-24 19:54:46,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:54:46,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:54:46,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:54:46,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:54:46,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... [2018-01-24 19:54:46,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:54:46,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:54:46,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:54:46,792 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:54:46,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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-01-24 19:54:46,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:54:46,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:54:46,844 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-24 19:54:46,844 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:54:46,845 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:54:46,845 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:54:46,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:54:46,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:54:46,845 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:54:46,845 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:54:46,846 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-24 19:54:46,846 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:54:46,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:54:46,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:54:47,067 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:54:47,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:54:47 BoogieIcfgContainer [2018-01-24 19:54:47,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:54:47,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:54:47,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:54:47,071 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:54:47,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:54:46" (1/3) ... [2018-01-24 19:54:47,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625e99e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:54:47, skipping insertion in model container [2018-01-24 19:54:47,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:54:46" (2/3) ... [2018-01-24 19:54:47,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625e99e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:54:47, skipping insertion in model container [2018-01-24 19:54:47,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:54:47" (3/3) ... [2018-01-24 19:54:47,075 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:54:47,081 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:54:47,087 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 19:54:47,125 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:54:47,125 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:54:47,125 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:54:47,125 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:54:47,126 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:54:47,126 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:54:47,126 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:54:47,126 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:54:47,127 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:54:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-24 19:54:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:54:47,155 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:47,156 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:54:47,157 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-01-24 19:54:47,165 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:47,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:47,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:47,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:47,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:47,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:47,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:47,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:54:47,411 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:47,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:54:47,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:54:47,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:54:47,499 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-24 19:54:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:47,611 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 19:54:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:54:47,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:54:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:47,625 INFO L225 Difference]: With dead ends: 70 [2018-01-24 19:54:47,625 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 19:54:47,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:54:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 19:54:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 19:54:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 19:54:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 19:54:47,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-24 19:54:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:47,660 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 19:54:47,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:54:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 19:54:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:54:47,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:47,661 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:54:47,661 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-01-24 19:54:47,662 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:47,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:47,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:47,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:47,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:47,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:47,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:47,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:54:47,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:47,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:54:47,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:54:47,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:54:47,825 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-24 19:54:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:47,918 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 19:54:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:54:47,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:54:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:47,919 INFO L225 Difference]: With dead ends: 41 [2018-01-24 19:54:47,919 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 19:54:47,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:54:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 19:54:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 19:54:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 19:54:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 19:54:47,926 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-24 19:54:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:47,927 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 19:54:47,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:54:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 19:54:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:54:47,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:47,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:54:47,928 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:47,928 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-01-24 19:54:47,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:47,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:47,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:47,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:47,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:47,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:47,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:47,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:54:47,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:47,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:54:47,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:54:47,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:54:47,973 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-24 19:54:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:48,086 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 19:54:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:54:48,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:54:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:48,087 INFO L225 Difference]: With dead ends: 40 [2018-01-24 19:54:48,087 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 19:54:48,087 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:54:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 19:54:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 19:54:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 19:54:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 19:54:48,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-24 19:54:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:48,093 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 19:54:48,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:54:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 19:54:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:54:48,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:48,094 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:54:48,094 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-01-24 19:54:48,095 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:48,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:48,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:48,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:48,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:48,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:54:48,163 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:48,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:54:48,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:54:48,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:54:48,164 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-24 19:54:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:48,209 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 19:54:48,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:54:48,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:54:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:48,210 INFO L225 Difference]: With dead ends: 39 [2018-01-24 19:54:48,211 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 19:54:48,211 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:54:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 19:54:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 19:54:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 19:54:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 19:54:48,215 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 19:54:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:48,215 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 19:54:48,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:54:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 19:54:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:54:48,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:48,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:54:48,216 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-01-24 19:54:48,216 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:48,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:48,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:48,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:48,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:48,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:54:48,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:48,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:54:48,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:54:48,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:54:48,265 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-24 19:54:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:48,354 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-24 19:54:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:54:48,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 19:54:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:48,355 INFO L225 Difference]: With dead ends: 38 [2018-01-24 19:54:48,355 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 19:54:48,355 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:54:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 19:54:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 19:54:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 19:54:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 19:54:48,361 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-01-24 19:54:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:48,362 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 19:54:48,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:54:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 19:54:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:54:48,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:48,363 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:54:48,363 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-01-24 19:54:48,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:48,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:48,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:48,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:48,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:48,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:54:48,524 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:48,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:54:48,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:54:48,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:54:48,525 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-24 19:54:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:48,634 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 19:54:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:54:48,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 19:54:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:48,635 INFO L225 Difference]: With dead ends: 42 [2018-01-24 19:54:48,635 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 19:54:48,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 19:54:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 19:54:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-01-24 19:54:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 19:54:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 19:54:48,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-24 19:54:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:48,640 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 19:54:48,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:54:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 19:54:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:54:48,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:48,640 INFO L322 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-01-24 19:54:48,641 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-01-24 19:54:48,641 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:48,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:48,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,642 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:48,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:48,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:48,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:54:48,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:48,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:54:48,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:54:48,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:54:48,702 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-24 19:54:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:48,827 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 19:54:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 19:54:48,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-24 19:54:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:48,863 INFO L225 Difference]: With dead ends: 41 [2018-01-24 19:54:48,863 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 19:54:48,864 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:54:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 19:54:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 19:54:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 19:54:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 19:54:48,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-01-24 19:54:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:48,870 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 19:54:48,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:54:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 19:54:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:54:48,871 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:48,871 INFO L322 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-01-24 19:54:48,871 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-01-24 19:54:48,871 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:48,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:48,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:48,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:48,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:49,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:49,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 19:54:49,037 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:49,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 19:54:49,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 19:54:49,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:54:49,038 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-01-24 19:54:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:49,138 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 19:54:49,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:54:49,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 19:54:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:49,139 INFO L225 Difference]: With dead ends: 44 [2018-01-24 19:54:49,139 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 19:54:49,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 19:54:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 19:54:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-01-24 19:54:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 19:54:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 19:54:49,144 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-01-24 19:54:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:49,144 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 19:54:49,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 19:54:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 19:54:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 19:54:49,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:49,145 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 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-01-24 19:54:49,145 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-01-24 19:54:49,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:49,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:49,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:49,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:49,146 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:49,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:49,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:54:49,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 19:54:49,332 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:54:49,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 19:54:49,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 19:54:49,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:54:49,332 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-01-24 19:54:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:54:49,877 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-24 19:54:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 19:54:49,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-01-24 19:54:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:54:49,878 INFO L225 Difference]: With dead ends: 101 [2018-01-24 19:54:49,878 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 19:54:49,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-01-24 19:54:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 19:54:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-01-24 19:54:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 19:54:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-24 19:54:49,886 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-01-24 19:54:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:54:49,886 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-24 19:54:49,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 19:54:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-24 19:54:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 19:54:49,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:54:49,888 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 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-01-24 19:54:49,888 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:54:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-01-24 19:54:49,888 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:54:49,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:49,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:54:49,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:54:49,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:54:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:54:49,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:54:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:54:50,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:54:50,129 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:54:50,130 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 19:54:50,132 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [20], [22], [23], [27], [33], [44], [49], [55], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 19:54:50,179 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:54:50,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:55:24,482 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:55:24,483 INFO L268 AbstractInterpreter]: Visited 26 different actions 36 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 19:55:24,498 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:55:24,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:55:24,498 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:55:24,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:24,519 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:55:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:24,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:55:24,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 19:55:24,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 19:55:24,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:55:24,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:24,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 19:55:24,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:55:24,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 19:55:24,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 19:55:24,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:55:24,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:55:24,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:55:24,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 19:55:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:25,024 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:55:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 19:55:25,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:55:25,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:55:25,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,314 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:55:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:25,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:55:25,340 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:55:25,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:25,344 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:55:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:25,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:55:25,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 19:55:25,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:55:25,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 19:55:25,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 19:55:25,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:25,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:55:26,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 19:55:26,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:55:26,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:55:26,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:55:26,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:55:26,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 19:55:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:26,595 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:55:26,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:55:26,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:55:26,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:55:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:26,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:55:26,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:55:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:26,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:55:26,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 13, 13] total 46 [2018-01-24 19:55:26,841 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:55:26,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 19:55:26,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 19:55:26,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1980, Unknown=1, NotChecked=0, Total=2162 [2018-01-24 19:55:26,842 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-01-24 19:55:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:28,182 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-24 19:55:28,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 19:55:28,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-24 19:55:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:28,185 INFO L225 Difference]: With dead ends: 79 [2018-01-24 19:55:28,185 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 19:55:28,186 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=358, Invalid=3063, Unknown=1, NotChecked=0, Total=3422 [2018-01-24 19:55:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 19:55:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-01-24 19:55:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 19:55:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 19:55:28,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-01-24 19:55:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:28,197 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 19:55:28,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 19:55:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 19:55:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:55:28,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:28,198 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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-01-24 19:55:28,198 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-01-24 19:55:28,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:28,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:28,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:28,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:28,199 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:28,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:28,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:55:28,456 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:55:28,456 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 19:55:28,456 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [19], [20], [23], [27], [31], [44], [49], [53], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 19:55:28,457 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:55:28,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown