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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:47:38,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:47:38,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:47:38,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:47:38,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:47:38,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:47:38,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:47:38,187 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:47:38,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:47:38,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:47:38,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:47:38,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:47:38,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:47:38,192 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:47:38,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:47:38,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:47:38,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:47:38,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:47:38,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:47:38,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:47:38,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:47:38,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:47:38,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:47:38,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:47:38,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:47:38,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:47:38,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:47:38,210 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:47:38,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:47:38,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:47:38,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:47:38,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:47:38,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:47:38,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:47:38,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:47:38,223 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:47:38,223 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:47:38,223 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:47:38,223 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:47:38,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:47:38,224 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:47:38,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:47:38,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:47:38,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:47:38,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:47:38,225 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:47:38,225 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:47:38,226 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:47:38,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:47:38,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:47:38,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:47:38,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:47:38,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:47:38,227 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:47:38,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:47:38,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:47:38,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:47:38,228 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:47:38,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:47:38,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:47:38,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:47:38,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:47:38,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:47:38,229 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:47:38,230 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:47:38,230 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:47:38,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:47:38,281 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:47:38,285 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:47:38,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:47:38,288 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:47:38,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:47:38,461 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:47:38,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:47:38,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:47:38,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:47:38,477 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:47:38,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bf5b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38, skipping insertion in model container [2018-01-24 11:47:38,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,501 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:47:38,543 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:47:38,656 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:47:38,673 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:47:38,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38 WrapperNode [2018-01-24 11:47:38,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:47:38,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:47:38,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:47:38,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:47:38,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (1/1) ... [2018-01-24 11:47:38,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:47:38,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:47:38,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:47:38,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:47:38,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (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 11:47:38,763 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:47:38,763 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:47:38,763 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-24 11:47:38,763 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:47:38,764 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:47:38,764 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:47:38,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:47:38,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:47:38,764 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:47:38,764 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:47:38,765 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-24 11:47:38,765 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:47:38,765 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:47:38,765 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:47:38,950 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:47:38,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:47:38 BoogieIcfgContainer [2018-01-24 11:47:38,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:47:38,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:47:38,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:47:38,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:47:38,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:47:38" (1/3) ... [2018-01-24 11:47:38,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be46785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:47:38, skipping insertion in model container [2018-01-24 11:47:38,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:38" (2/3) ... [2018-01-24 11:47:38,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be46785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:47:38, skipping insertion in model container [2018-01-24 11:47:38,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:47:38" (3/3) ... [2018-01-24 11:47:38,956 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:47:38,963 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:47:38,969 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 11:47:39,006 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:47:39,006 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:47:39,006 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:47:39,007 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:47:39,007 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:47:39,007 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:47:39,007 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:47:39,007 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:47:39,008 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:47:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-01-24 11:47:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:47:39,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:39,039 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:39,040 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501255, now seen corresponding path program 1 times [2018-01-24 11:47:39,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:39,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:39,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:39,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:39,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:39,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:39,304 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 11:47:39,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:39,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:39,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:47:39,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:47:39,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:47:39,327 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-01-24 11:47:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:39,502 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-01-24 11:47:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:47:39,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:47:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:39,516 INFO L225 Difference]: With dead ends: 74 [2018-01-24 11:47:39,516 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 11:47:39,520 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 11:47:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 11:47:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 11:47:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 11:47:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 11:47:39,559 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2018-01-24 11:47:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:39,560 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 11:47:39,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:47:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 11:47:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:47:39,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:39,561 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:39,561 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501254, now seen corresponding path program 1 times [2018-01-24 11:47:39,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:39,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:39,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:39,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:39,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:39,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:39,731 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 11:47:39,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:39,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:39,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:39,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:39,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:39,733 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-01-24 11:47:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:39,854 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 11:47:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:39,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 11:47:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:39,858 INFO L225 Difference]: With dead ends: 43 [2018-01-24 11:47:39,859 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:47:39,860 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 11:47:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:47:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 11:47:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 11:47:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 11:47:39,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-01-24 11:47:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:39,869 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 11:47:39,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 11:47:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:47:39,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:39,870 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:39,871 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash -76898612, now seen corresponding path program 1 times [2018-01-24 11:47:39,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:39,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:39,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:39,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:39,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:39,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:39,922 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 11:47:39,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:39,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:39,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:47:39,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:47:39,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:47:39,923 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-01-24 11:47:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:39,997 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-01-24 11:47:39,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:47:39,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:47:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:39,998 INFO L225 Difference]: With dead ends: 42 [2018-01-24 11:47:39,999 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:47:39,999 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 11:47:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:47:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 11:47:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:47:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 11:47:40,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-01-24 11:47:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:40,005 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 11:47:40,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:47:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 11:47:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:47:40,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:40,006 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:40,006 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash -76898611, now seen corresponding path program 1 times [2018-01-24 11:47:40,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:40,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:40,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:40,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:40,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:40,099 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 11:47:40,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:40,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:47:40,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:47:40,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:47:40,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:40,100 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-01-24 11:47:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:40,143 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-01-24 11:47:40,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:40,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:47:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:40,145 INFO L225 Difference]: With dead ends: 41 [2018-01-24 11:47:40,145 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:47:40,145 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 11:47:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:47:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 11:47:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:47:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-01-24 11:47:40,151 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-01-24 11:47:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:40,151 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-01-24 11:47:40,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:47:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-01-24 11:47:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:47:40,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:40,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:40,152 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085779, now seen corresponding path program 1 times [2018-01-24 11:47:40,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:40,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:40,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:40,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:40,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:40,218 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 11:47:40,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:40,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:40,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:40,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:40,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:40,219 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-01-24 11:47:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:40,303 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-01-24 11:47:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:40,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 11:47:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:40,306 INFO L225 Difference]: With dead ends: 40 [2018-01-24 11:47:40,306 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 11:47:40,306 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 11:47:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 11:47:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 11:47:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 11:47:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-24 11:47:40,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2018-01-24 11:47:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:40,311 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-24 11:47:40,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-24 11:47:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:47:40,312 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:40,312 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:40,312 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085778, now seen corresponding path program 1 times [2018-01-24 11:47:40,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:40,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:40,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:40,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:40,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:40,464 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 11:47:40,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:40,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:47:40,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:47:40,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:47:40,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:47:40,466 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-01-24 11:47:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:40,582 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-01-24 11:47:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:47:40,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 11:47:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:40,584 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:47:40,584 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 11:47:40,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:47:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 11:47:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-01-24 11:47:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 11:47:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 11:47:40,588 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-01-24 11:47:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:40,588 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 11:47:40,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:47:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 11:47:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:47:40,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:40,589 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 11:47:40,589 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -551391085, now seen corresponding path program 1 times [2018-01-24 11:47:40,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:40,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:40,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:40,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:40,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:40,649 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 11:47:40,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:40,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:47:40,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:47:40,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:47:40,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:47:40,651 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-01-24 11:47:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:40,754 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-24 11:47:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:47:40,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 11:47:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:40,757 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:47:40,758 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 11:47:40,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:47:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 11:47:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-01-24 11:47:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:47:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 11:47:40,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2018-01-24 11:47:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:40,764 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 11:47:40,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:47:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 11:47:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:47:40,765 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:40,766 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 11:47:40,766 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash -551391084, now seen corresponding path program 1 times [2018-01-24 11:47:40,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:40,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:40,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:40,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:40,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:41,001 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 11:47:41,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:41,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 11:47:41,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:47:41,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:47:41,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:47:41,002 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-01-24 11:47:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:41,123 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-01-24 11:47:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:47:41,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 11:47:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:41,125 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:47:41,125 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:47:41,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:47:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:47:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-01-24 11:47:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 11:47:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 11:47:41,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-01-24 11:47:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:41,132 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 11:47:41,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:47:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 11:47:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:47:41,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:41,133 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:41,134 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1601452084, now seen corresponding path program 1 times [2018-01-24 11:47:41,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:41,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:41,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:41,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:41,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:41,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:41,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:41,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 11:47:41,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:47:41,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:47:41,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:47:41,506 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-01-24 11:47:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:41,771 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-01-24 11:47:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:47:41,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-01-24 11:47:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:41,772 INFO L225 Difference]: With dead ends: 93 [2018-01-24 11:47:41,772 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 11:47:41,773 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:47:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 11:47:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-01-24 11:47:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 11:47:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 11:47:41,781 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-01-24 11:47:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:41,781 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 11:47:41,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:47:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 11:47:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:47:41,782 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:41,782 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:41,783 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1820306802, now seen corresponding path program 1 times [2018-01-24 11:47:41,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:41,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:41,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:41,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:41,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:41,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:42,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:42,090 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:47:42,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:42,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:42,177 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 11:47:42,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:47:42,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:42,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:42,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:47:42,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:47:42,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-01-24 11:47:42,331 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 11:47:42,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,344 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 11:47:42,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:47:42,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 11:47:42,390 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 11:47:42,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 11:47:42,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 11:47:42,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-24 11:47:42,656 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 11:47:42,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:42,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:47:42,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:42,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:42,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:42,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 11:47:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:42,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:42,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-24 11:47:42,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:47:42,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:47:42,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:47:42,782 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 26 states. [2018-01-24 11:47:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:45,870 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-01-24 11:47:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:47:45,871 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-01-24 11:47:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:45,872 INFO L225 Difference]: With dead ends: 81 [2018-01-24 11:47:45,872 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 11:47:45,873 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=214, Invalid=1424, Unknown=2, NotChecked=0, Total=1640 [2018-01-24 11:47:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 11:47:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-01-24 11:47:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 11:47:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-01-24 11:47:45,885 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2018-01-24 11:47:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:45,885 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-01-24 11:47:45,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:47:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-01-24 11:47:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:47:45,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:45,887 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 11:47:45,887 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1820393708, now seen corresponding path program 1 times [2018-01-24 11:47:45,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:45,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:45,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:45,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:45,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:45,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:46,065 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 11:47:46,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:46,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:47:46,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:47:46,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:47:46,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:47:46,066 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 12 states. [2018-01-24 11:47:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:46,299 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2018-01-24 11:47:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:47:46,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-01-24 11:47:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:46,301 INFO L225 Difference]: With dead ends: 167 [2018-01-24 11:47:46,301 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 11:47:46,302 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:47:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 11:47:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2018-01-24 11:47:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 11:47:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-24 11:47:46,321 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 28 [2018-01-24 11:47:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:46,322 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-24 11:47:46,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:47:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-24 11:47:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:47:46,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:46,324 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 11:47:46,324 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2051871762, now seen corresponding path program 1 times [2018-01-24 11:47:46,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:46,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:46,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:46,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:46,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:46,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:46,655 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 11:47:46,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:46,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:46,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:46,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:46,716 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 11:47:46,720 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 11:47:46,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:46,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:46,731 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 11:47:46,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:47:46,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 11:47:46,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:47:46,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:46,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:46,992 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 11:47:46,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 11:47:47,178 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 11:47:47,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:47,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-24 11:47:47,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 11:47:47,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 11:47:47,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:47:47,202 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 21 states. [2018-01-24 11:47:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:48,680 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-01-24 11:47:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:47:48,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 11:47:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:48,682 INFO L225 Difference]: With dead ends: 139 [2018-01-24 11:47:48,682 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 11:47:48,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:47:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 11:47:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2018-01-24 11:47:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:47:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-01-24 11:47:48,704 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-01-24 11:47:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:48,705 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-01-24 11:47:48,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 11:47:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-01-24 11:47:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:47:48,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:48,706 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, 1, 1] [2018-01-24 11:47:48,707 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1662272263, now seen corresponding path program 1 times [2018-01-24 11:47:48,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:48,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:48,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:48,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:48,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:48,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:48,850 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 11:47:48,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:48,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:47:48,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:47:48,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:47:48,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:47:48,851 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 7 states. [2018-01-24 11:47:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:48,980 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2018-01-24 11:47:48,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:47:48,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 11:47:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:48,981 INFO L225 Difference]: With dead ends: 114 [2018-01-24 11:47:48,981 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 11:47:48,982 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:47:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 11:47:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 11:47:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 11:47:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-24 11:47:48,993 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 30 [2018-01-24 11:47:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:48,993 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-24 11:47:48,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:47:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-24 11:47:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:47:48,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:48,994 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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 11:47:48,995 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -795993964, now seen corresponding path program 2 times [2018-01-24 11:47:48,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:48,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:48,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:48,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:48,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:49,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:49,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:49,399 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:47:49,406 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:47:49,418 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:49,424 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:49,425 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:47:49,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:49,447 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 11:47:49,449 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 11:47:49,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:49,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:49,454 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 11:47:49,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:47:49,743 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 30 treesize of output 24 [2018-01-24 11:47:49,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:49,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-01-24 11:47:49,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:49,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:49,776 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 11:47:49,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-01-24 11:47:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:49,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:49,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-01-24 11:47:49,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 11:47:49,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 11:47:49,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:47:49,878 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 27 states. [2018-01-24 11:47:51,414 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 98 DAG size of output 74 [2018-01-24 11:47:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:52,487 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-01-24 11:47:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:47:52,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-01-24 11:47:52,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:52,488 INFO L225 Difference]: With dead ends: 100 [2018-01-24 11:47:52,488 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 11:47:52,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=323, Invalid=2029, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 11:47:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 11:47:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2018-01-24 11:47:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 11:47:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-24 11:47:52,500 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2018-01-24 11:47:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:52,500 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-24 11:47:52,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 11:47:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-24 11:47:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 11:47:52,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:52,501 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:52,501 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:47:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 184039152, now seen corresponding path program 2 times [2018-01-24 11:47:52,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:52,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:52,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:52,502 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:47:52,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:52,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:52,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:52,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:52,901 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:47:52,915 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:52,922 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:52,926 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:47:52,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:52,932 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 11:47:52,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:52,938 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 11:47:52,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:52,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:52,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:47:53,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:53,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:53,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:47:53,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:47:53,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 11:47:53,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-01-24 11:47:53,062 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 11:47:53,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,076 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 11:47:53,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 11:47:53,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 11:47:53,105 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 11:47:53,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:47:53,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 11:47:53,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-24 11:47:53,405 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 11:47:53,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:53,414 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 18 treesize of output 15 [2018-01-24 11:47:53,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:53,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:53,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:53,426 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 11:47:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:53,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:53,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-24 11:47:53,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 11:47:53,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 11:47:53,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-01-24 11:47:53,539 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 29 states. [2018-01-24 11:47:54,471 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-24 11:47:54,656 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-01-24 11:47:56,358 WARN L146 SmtUtils]: Spent 1521ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-01-24 11:47:56,601 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-01-24 11:47:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:56,732 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-24 11:47:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:47:56,733 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2018-01-24 11:47:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:56,733 INFO L225 Difference]: With dead ends: 73 [2018-01-24 11:47:56,733 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:47:56,734 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 11:47:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:47:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:47:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:47:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:47:56,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-24 11:47:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:56,735 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:47:56,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 11:47:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:47:56,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:47:56,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Received shutdown request... [2018-01-24 11:48:48,867 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-24 11:48:48,868 INFO L168 Benchmark]: Toolchain (without parser) took 70406.53 ms. Allocated memory was 302.0 MB in the beginning and 579.3 MB in the end (delta: 277.3 MB). Free memory was 261.0 MB in the beginning and 436.3 MB in the end (delta: -175.3 MB). Peak memory consumption was 232.9 MB. Max. memory is 5.3 GB. [2018-01-24 11:48:48,870 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 302.0 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:48:48,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.52 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:48:48,870 INFO L168 Benchmark]: Boogie Preprocessor took 29.05 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:48:48,870 INFO L168 Benchmark]: RCFGBuilder took 241.31 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 230.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:48:48,871 INFO L168 Benchmark]: TraceAbstraction took 69916.38 ms. Allocated memory was 302.0 MB in the beginning and 579.3 MB in the end (delta: 277.3 MB). Free memory was 230.5 MB in the beginning and 436.3 MB in the end (delta: -205.8 MB). Peak memory consumption was 202.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:48:48,872 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 302.0 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.52 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.05 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 241.31 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 230.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69916.38 ms. Allocated memory was 302.0 MB in the beginning and 579.3 MB in the end (delta: 277.3 MB). Free memory was 230.5 MB in the beginning and 436.3 MB in the end (delta: -205.8 MB). Peak memory consumption was 202.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 239. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-48-48-878.csv Completed graceful shutdown