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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:47:34,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:47:34,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:47:34,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:47:34,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:47:34,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:47:34,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:47:34,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:47:34,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:47:34,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:47:34,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:47:34,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:47:34,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:47:34,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:47:34,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:47:34,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:47:34,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:47:34,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:47:34,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:47:34,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:47:34,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:47:34,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:47:34,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:47:34,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:47:34,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:47:34,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:47:34,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:47:34,130 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:47:34,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:47:34,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:47:34,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:47:34,131 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:47:34,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:47:34,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:47:34,142 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:47:34,143 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:47:34,143 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:47:34,143 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:47:34,143 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:47:34,144 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:47:34,144 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:47:34,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:47:34,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:47:34,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:47:34,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:47:34,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:47:34,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:47:34,146 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:47:34,146 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:47:34,146 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:47:34,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:47:34,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:47:34,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:47:34,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:47:34,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:47:34,147 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:47:34,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:47:34,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:47:34,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:47:34,148 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:47:34,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:47:34,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:47:34,149 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:47:34,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:47:34,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:47:34,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:47:34,149 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:47:34,150 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:47:34,151 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:47:34,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:47:34,200 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:47:34,205 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:47:34,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:47:34,207 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:47:34,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:47:34,381 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:47:34,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:47:34,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:47:34,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:47:34,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:47:34,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34, skipping insertion in model container [2018-01-24 19:47:34,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,412 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:47:34,449 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:47:34,563 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:47:34,585 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:47:34,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34 WrapperNode [2018-01-24 19:47:34,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:47:34,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:47:34,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:47:34,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:47:34,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (1/1) ... [2018-01-24 19:47:34,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:47:34,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:47:34,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:47:34,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:47:34,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (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:47:34,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:47:34,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:47:34,685 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-24 19:47:34,685 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:47:34,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:47:34,927 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:47:34,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:47:34 BoogieIcfgContainer [2018-01-24 19:47:34,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:47:34,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:47:34,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:47:34,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:47:34,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:47:34" (1/3) ... [2018-01-24 19:47:34,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1676e4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:47:34, skipping insertion in model container [2018-01-24 19:47:34,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:47:34" (2/3) ... [2018-01-24 19:47:34,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1676e4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:47:34, skipping insertion in model container [2018-01-24 19:47:34,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:47:34" (3/3) ... [2018-01-24 19:47:34,934 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:47:34,940 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:47:34,946 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 19:47:34,992 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:47:34,993 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:47:34,993 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:47:34,993 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:47:34,993 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:47:34,993 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:47:34,993 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:47:34,993 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:47:34,994 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:47:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 19:47:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:47:35,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:35,021 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:35,021 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-01-24 19:47:35,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:35,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:35,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:35,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:35,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:35,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:35,253 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:47:35,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:35,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:47:35,256 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:35,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:47:35,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:47:35,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:47:35,275 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 19:47:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:35,523 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-24 19:47:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:47:35,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:47:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:35,560 INFO L225 Difference]: With dead ends: 96 [2018-01-24 19:47:35,560 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 19:47:35,563 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:47:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 19:47:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 19:47:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 19:47:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 19:47:35,591 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 19:47:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:35,592 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 19:47:35,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:47:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 19:47:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:47:35,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:35,592 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:35,592 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-01-24 19:47:35,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:35,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:35,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:35,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:35,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:35,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:35,785 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:47:35,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:35,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:47:35,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:35,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:47:35,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:47:35,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:47:35,789 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 19:47:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:35,897 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 19:47:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:47:35,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:47:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:35,899 INFO L225 Difference]: With dead ends: 54 [2018-01-24 19:47:35,899 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:47:35,900 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:47:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:47:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 19:47:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:47:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 19:47:35,905 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 19:47:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:35,906 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 19:47:35,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:47:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 19:47:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:47:35,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:35,906 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:35,906 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-01-24 19:47:35,907 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:35,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:35,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:35,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:35,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:35,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:35,984 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:47:35,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:35,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:47:35,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:35,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:47:35,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:47:35,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:47:35,985 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 19:47:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:36,078 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 19:47:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:47:36,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:47:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:36,079 INFO L225 Difference]: With dead ends: 53 [2018-01-24 19:47:36,080 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:47:36,080 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:47:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:47:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:47:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:47:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 19:47:36,087 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 19:47:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:36,088 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 19:47:36,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:47:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 19:47:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:47:36,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:36,089 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:36,089 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-01-24 19:47:36,089 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:36,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:36,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:36,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:36,167 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:47:36,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:36,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:47:36,168 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:36,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:47:36,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:47:36,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:47:36,169 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 19:47:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:36,233 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 19:47:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:47:36,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:47:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:36,234 INFO L225 Difference]: With dead ends: 52 [2018-01-24 19:47:36,235 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 19:47:36,235 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:47:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 19:47:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 19:47:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 19:47:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 19:47:36,241 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 19:47:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:36,241 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 19:47:36,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:47:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 19:47:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:47:36,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:36,243 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:36,243 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-01-24 19:47:36,243 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:36,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:36,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:36,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:36,296 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:47:36,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:36,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:47:36,296 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:36,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:47:36,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:47:36,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:47:36,298 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 19:47:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:36,380 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 19:47:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:47:36,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 19:47:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:36,381 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:47:36,381 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:47:36,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:47:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:47:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:47:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:47:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 19:47:36,387 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-24 19:47:36,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:36,387 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 19:47:36,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:47:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 19:47:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:47:36,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:36,388 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:36,388 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:36,388 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-01-24 19:47:36,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:36,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:36,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,389 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:36,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:47:36,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:36,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:47:36,491 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:36,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:47:36,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:47:36,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:47:36,492 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-24 19:47:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:36,608 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-24 19:47:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:47:36,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 19:47:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:36,611 INFO L225 Difference]: With dead ends: 75 [2018-01-24 19:47:36,611 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 19:47:36,612 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:47:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 19:47:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-24 19:47:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:47:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 19:47:36,618 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-24 19:47:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:36,619 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 19:47:36,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:47:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 19:47:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:47:36,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:36,620 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, 1] [2018-01-24 19:47:36,620 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-01-24 19:47:36,620 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:36,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:36,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:36,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:36,682 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:47:36,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:36,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:47:36,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:36,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:47:36,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:47:36,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:47:36,683 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-24 19:47:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:36,760 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 19:47:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:47:36,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 19:47:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:36,762 INFO L225 Difference]: With dead ends: 56 [2018-01-24 19:47:36,762 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:47:36,763 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:47:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:47:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-24 19:47:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:47:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:47:36,769 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-24 19:47:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:36,769 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:47:36,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:47:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:47:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:47:36,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:36,771 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, 1] [2018-01-24 19:47:36,771 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-01-24 19:47:36,771 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:36,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:36,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:36,772 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:36,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:36,988 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:47:36,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:36,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:47:36,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:36,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:47:36,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:47:36,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:47:36,990 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-24 19:47:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:37,123 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 19:47:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:47:37,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 19:47:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:37,124 INFO L225 Difference]: With dead ends: 70 [2018-01-24 19:47:37,125 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 19:47:37,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:47:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 19:47:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 19:47:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 19:47:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-24 19:47:37,131 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-24 19:47:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:37,132 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-24 19:47:37,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:47:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-24 19:47:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:47:37,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:37,133 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, 1, 1, 1, 1, 1, 1] [2018-01-24 19:47:37,133 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-01-24 19:47:37,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:37,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:37,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:37,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:37,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:37,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:37,234 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:47:37,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:37,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:47:37,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:37,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:47:37,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:47:37,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:47:37,235 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-01-24 19:47:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:37,411 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-01-24 19:47:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:47:37,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 19:47:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:37,413 INFO L225 Difference]: With dead ends: 58 [2018-01-24 19:47:37,413 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:47:37,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:47:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:47:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 19:47:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:47:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 19:47:37,434 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-24 19:47:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:37,435 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 19:47:37,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:47:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 19:47:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:47:37,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:37,436 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, 1] [2018-01-24 19:47:37,436 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-01-24 19:47:37,436 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:37,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:37,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:37,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:37,438 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:37,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:37,474 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:47:37,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:37,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:47:37,475 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:37,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:47:37,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:47:37,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:47:37,476 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-01-24 19:47:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:37,487 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-24 19:47:37,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:47:37,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 19:47:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:37,488 INFO L225 Difference]: With dead ends: 78 [2018-01-24 19:47:37,488 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:47:37,489 INFO L525 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-01-24 19:47:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:47:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:47:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:47:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:47:37,499 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-24 19:47:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:37,499 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:47:37,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:47:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:47:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:47:37,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:37,500 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, 1, 1, 1] [2018-01-24 19:47:37,501 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:37,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-01-24 19:47:37,501 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:37,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:37,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:37,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:37,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:37,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 19:47:37,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:37,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 19:47:37,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:37,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:47:37,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:47:37,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:47:37,874 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-24 19:47:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:38,050 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 19:47:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 19:47:38,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 19:47:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:38,051 INFO L225 Difference]: With dead ends: 93 [2018-01-24 19:47:38,051 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:47:38,051 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 19:47:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:47:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:47:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:47:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 19:47:38,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-01-24 19:47:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:38,057 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 19:47:38,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:47:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 19:47:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:47:38,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:38,059 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, 1, 1, 1] [2018-01-24 19:47:38,059 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-01-24 19:47:38,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:38,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:38,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:38,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:38,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:38,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:38,235 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:47:38,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:47:38,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 19:47:38,236 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:47:38,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:47:38,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:47:38,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:47:38,236 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-24 19:47:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:47:38,381 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-01-24 19:47:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 19:47:38,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 19:47:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:47:38,382 INFO L225 Difference]: With dead ends: 107 [2018-01-24 19:47:38,382 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 19:47:38,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-24 19:47:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 19:47:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 19:47:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 19:47:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 19:47:38,392 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-01-24 19:47:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:47:38,393 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 19:47:38,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:47:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 19:47:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:47:38,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:47:38,394 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, 1, 1, 1] [2018-01-24 19:47:38,394 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:47:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-01-24 19:47:38,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:47:38,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:38,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:47:38,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:47:38,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:47:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:47:38,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:47:38,621 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:47:38,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:47:38,622 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:47:38,623 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 19:47:38,625 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [14], [15], [18], [22], [24], [26], [27], [30], [31], [34], [42], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 19:47:38,678 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:47:38,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:48:04,811 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:48:04,812 INFO L268 AbstractInterpreter]: Visited 29 different actions 45 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 19:48:04,833 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:48:04,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:48:04,834 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:48:04,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:04,846 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:48:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:04,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:48:04,923 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:48:04,926 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:48:04,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:48:04,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:04,952 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:48:04,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:48:05,124 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 18 treesize of output 14 [2018-01-24 19:48:05,141 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 14 treesize of output 11 [2018-01-24 19:48:05,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:48:05,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:48:05,159 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:48:05,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 19:48:05,289 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:48:05,290 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:48:05,579 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:48:05,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,586 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:48:05,595 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:48:05,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,602 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:48:05,602 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:48:05,612 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:48:05,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:48:05,634 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:48:05,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:05,639 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:48:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:05,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:48:05,706 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:48:05,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:48:05,756 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:48:05,757 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:48:05,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:05,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:48:05,907 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:48:05,912 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 16 [2018-01-24 19:48:05,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:48:05,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:48:05,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:48:05,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 19:48:06,030 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:48:06,030 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:48:06,125 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:48:06,133 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:48:06,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:48:06,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:06,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:48:06,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:48:06,212 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:48:06,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:48:06,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 19:48:06,214 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:48:06,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 19:48:06,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 19:48:06,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 19:48:06,215 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-01-24 19:48:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:07,287 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-24 19:48:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:48:07,288 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-01-24 19:48:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:07,289 INFO L225 Difference]: With dead ends: 106 [2018-01-24 19:48:07,289 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 19:48:07,290 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 19:48:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 19:48:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-01-24 19:48:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 19:48:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-24 19:48:07,303 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-01-24 19:48:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:07,303 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-24 19:48:07,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 19:48:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-24 19:48:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 19:48:07,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:07,305 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, 1, 1, 1, 1] [2018-01-24 19:48:07,305 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:48:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-01-24 19:48:07,305 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:07,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:07,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:07,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:07,306 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:07,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:07,387 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:48:07,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:07,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 19:48:07,388 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:07,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 19:48:07,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 19:48:07,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:48:07,388 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-01-24 19:48:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:07,540 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-01-24 19:48:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:48:07,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 19:48:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:07,541 INFO L225 Difference]: With dead ends: 132 [2018-01-24 19:48:07,541 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 19:48:07,541 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-01-24 19:48:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 19:48:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-01-24 19:48:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 19:48:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-24 19:48:07,550 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-01-24 19:48:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:07,550 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-24 19:48:07,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 19:48:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-24 19:48:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 19:48:07,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:07,551 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, 1, 1, 1, 1, 1, 1] [2018-01-24 19:48:07,552 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:48:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-01-24 19:48:07,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:07,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:07,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:07,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:07,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:07,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:07,836 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:48:07,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:48:07,836 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:48:07,836 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 19:48:07,837 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [15], [18], [22], [24], [27], [30], [31], [34], [40], [46], [52], [54], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 19:48:07,838 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:48:07,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 19:48:30,244 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 19:48:30,245 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 19:48:30,245 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:48:30,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:48:30,245 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:48:30,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:30,251 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:48:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:30,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:48:30,271 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 19:48:30,271 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:48:30,274 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:48:30,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:48:30 BoogieIcfgContainer [2018-01-24 19:48:30,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:48:30,275 INFO L168 Benchmark]: Toolchain (without parser) took 55893.97 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 266.1 MB in the beginning and 755.0 MB in the end (delta: -488.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 19:48:30,276 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:48:30,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.82 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:48:30,276 INFO L168 Benchmark]: Boogie Preprocessor took 37.93 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 254.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 19:48:30,277 INFO L168 Benchmark]: RCFGBuilder took 295.05 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 233.1 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-24 19:48:30,277 INFO L168 Benchmark]: TraceAbstraction took 55346.47 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 233.1 MB in the beginning and 755.0 MB in the end (delta: -522.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 19:48:30,278 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.82 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.93 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 254.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.05 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 233.1 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55346.47 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 233.1 MB in the beginning and 755.0 MB in the end (delta: -522.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 378 LocStat_NO_SUPPORTING_DISEQUALITIES : 82 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.478674 RENAME_VARIABLES(MILLISECONDS) : 0.315357 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.428808 PROJECTAWAY(MILLISECONDS) : 0.965420 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091016 DISJOIN(MILLISECONDS) : 0.411725 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.345799 ADD_EQUALITY(MILLISECONDS) : 0.018095 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012429 #CONJOIN_DISJUNCTIVE : 81 #RENAME_VARIABLES : 135 #UNFREEZE : 0 #CONJOIN : 140 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 55.2s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 551 SDtfs, 836 SDslu, 1415 SDs, 0 SdLazy, 1286 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 48.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 415 ConstructedInterpolants, 14 QuantifiedInterpolants, 71331 SizeOfPredicates, 25 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 8/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-48-30-286.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-48-30-286.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-48-30-286.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-48-30-286.csv Completed graceful shutdown