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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:46:17,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:46:17,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:46:17,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:46:17,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:46:17,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:46:17,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:46:17,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:46:17,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:46:17,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:46:17,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:46:17,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:46:17,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:46:17,523 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:46:17,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:46:17,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:46:17,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:46:17,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:46:17,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:46:17,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:46:17,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:46:17,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:46:17,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:46:17,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:46:17,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:46:17,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:46:17,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:46:17,535 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:46:17,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:46:17,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:46:17,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:46:17,536 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:46:17,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:46:17,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:46:17,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:46:17,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:46:17,548 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:46:17,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:46:17,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:46:17,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:46:17,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:46:17,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:46:17,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:46:17,549 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:46:17,549 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:46:17,549 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:46:17,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:46:17,550 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:46:17,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:46:17,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:46:17,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:46:17,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:46:17,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:46:17,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:46:17,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:46:17,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:46:17,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:46:17,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:46:17,590 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:46:17,593 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:46:17,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:46:17,595 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:46:17,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:46:17,787 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:46:17,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:46:17,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:46:17,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:46:17,794 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:46:17,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc5225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17, skipping insertion in model container [2018-02-02 08:46:17,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,807 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:46:17,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:46:17,931 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:46:17,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:46:17,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17 WrapperNode [2018-02-02 08:46:17,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:46:17,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:46:17,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:46:17,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:46:17,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... [2018-02-02 08:46:17,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:46:17,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:46:17,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:46:17,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:46:17,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 08:46:18,023 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:46:18,024 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:46:18,024 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-02 08:46:18,024 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:46:18,024 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:46:18,024 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:46:18,024 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:46:18,024 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:46:18,025 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:46:18,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:46:18,025 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-02 08:46:18,025 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:46:18,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:46:18,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:46:18,185 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:46:18,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:46:18 BoogieIcfgContainer [2018-02-02 08:46:18,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:46:18,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:46:18,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:46:18,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:46:18,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:46:17" (1/3) ... [2018-02-02 08:46:18,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dbe541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:46:18, skipping insertion in model container [2018-02-02 08:46:18,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:17" (2/3) ... [2018-02-02 08:46:18,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dbe541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:46:18, skipping insertion in model container [2018-02-02 08:46:18,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:46:18" (3/3) ... [2018-02-02 08:46:18,190 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:46:18,197 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:46:18,202 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 08:46:18,233 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:46:18,233 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:46:18,233 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:46:18,233 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:46:18,234 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:46:18,234 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:46:18,234 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:46:18,234 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:46:18,235 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:46:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-02-02 08:46:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:46:18,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:18,256 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:18,256 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501255, now seen corresponding path program 1 times [2018-02-02 08:46:18,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:18,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:18,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:18,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:18,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:18,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:18,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:46:18,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:46:18,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:46:18,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:46:18,457 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-02-02 08:46:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:18,584 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-02 08:46:18,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:46:18,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 08:46:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:18,593 INFO L225 Difference]: With dead ends: 46 [2018-02-02 08:46:18,593 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 08:46:18,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-02 08:46:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 08:46:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 08:46:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:46:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 08:46:18,619 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2018-02-02 08:46:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:18,619 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 08:46:18,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:46:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 08:46:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:46:18,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:18,620 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:18,620 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501254, now seen corresponding path program 1 times [2018-02-02 08:46:18,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:18,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:18,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:18,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:18,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:18,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:18,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:18,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:18,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:18,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:18,726 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-02-02 08:46:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:18,781 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-02 08:46:18,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:46:18,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 08:46:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:18,783 INFO L225 Difference]: With dead ends: 42 [2018-02-02 08:46:18,783 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 08:46:18,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:46:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 08:46:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 08:46:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 08:46:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-02 08:46:18,789 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-02 08:46:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:18,789 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-02 08:46:18,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-02 08:46:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:46:18,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:18,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:18,790 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash -76898612, now seen corresponding path program 1 times [2018-02-02 08:46:18,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:18,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:18,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:18,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:18,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:18,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:18,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:46:18,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:46:18,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:46:18,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:46:18,827 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-02-02 08:46:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:18,861 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-02 08:46:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:46:18,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:46:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:18,862 INFO L225 Difference]: With dead ends: 41 [2018-02-02 08:46:18,862 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 08:46:18,862 INFO L554 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-02-02 08:46:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 08:46:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 08:46:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 08:46:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 08:46:18,864 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-02 08:46:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:18,865 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 08:46:18,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:46:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 08:46:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:46:18,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:18,865 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:18,865 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash -76898611, now seen corresponding path program 1 times [2018-02-02 08:46:18,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:18,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:18,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:18,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:18,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:18,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:18,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:46:18,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:46:18,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:46:18,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:46:18,945 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-02-02 08:46:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:18,987 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-02 08:46:18,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:46:18,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 08:46:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:18,988 INFO L225 Difference]: With dead ends: 40 [2018-02-02 08:46:18,989 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 08:46:18,989 INFO L554 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-02-02 08:46:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 08:46:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 08:46:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 08:46:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-02 08:46:18,992 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-02-02 08:46:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:18,992 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-02 08:46:18,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:46:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-02 08:46:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:46:18,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:18,993 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:18,993 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085779, now seen corresponding path program 1 times [2018-02-02 08:46:18,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:18,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:18,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:18,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:18,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:19,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:19,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:19,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:19,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:19,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:19,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:19,040 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-02-02 08:46:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:19,101 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-02-02 08:46:19,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:46:19,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 08:46:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:19,102 INFO L225 Difference]: With dead ends: 39 [2018-02-02 08:46:19,102 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 08:46:19,103 INFO L554 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-02-02 08:46:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 08:46:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 08:46:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 08:46:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-02 08:46:19,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2018-02-02 08:46:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:19,107 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-02 08:46:19,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-02 08:46:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:46:19,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:19,107 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:19,108 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085778, now seen corresponding path program 1 times [2018-02-02 08:46:19,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:19,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:19,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:19,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:19,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:19,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:19,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:46:19,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:46:19,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:46:19,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:46:19,190 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-02-02 08:46:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:19,260 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-02-02 08:46:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:46:19,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 08:46:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:19,261 INFO L225 Difference]: With dead ends: 44 [2018-02-02 08:46:19,261 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 08:46:19,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:46:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 08:46:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-02-02 08:46:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 08:46:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-02 08:46:19,263 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-02-02 08:46:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:19,264 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-02 08:46:19,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:46:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-02 08:46:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:46:19,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:19,264 INFO L351 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-02-02 08:46:19,264 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash -551391085, now seen corresponding path program 1 times [2018-02-02 08:46:19,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:19,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:19,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:19,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:19,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:19,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-02-02 08:46:19,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:19,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:46:19,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:46:19,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:46:19,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:46:19,305 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-02 08:46:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:19,378 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 08:46:19,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:46:19,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 08:46:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:19,380 INFO L225 Difference]: With dead ends: 46 [2018-02-02 08:46:19,380 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:46:19,381 INFO L554 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-02-02 08:46:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:46:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-02-02 08:46:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 08:46:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 08:46:19,383 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2018-02-02 08:46:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:19,383 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 08:46:19,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:46:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 08:46:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:46:19,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:19,384 INFO L351 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-02-02 08:46:19,384 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -551391084, now seen corresponding path program 1 times [2018-02-02 08:46:19,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:19,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:19,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:19,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:19,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:19,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:19,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:46:19,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:46:19,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:46:19,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:46:19,497 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-02 08:46:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:19,587 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-02 08:46:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:46:19,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-02 08:46:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:19,588 INFO L225 Difference]: With dead ends: 45 [2018-02-02 08:46:19,588 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:46:19,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:46:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:46:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-02-02 08:46:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:46:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 08:46:19,591 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-02-02 08:46:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:19,592 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 08:46:19,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:46:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 08:46:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:46:19,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:19,592 INFO L351 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-02-02 08:46:19,593 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1601452084, now seen corresponding path program 1 times [2018-02-02 08:46:19,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:19,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:19,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:19,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:19,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:19,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:19,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 08:46:19,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:46:19,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:46:19,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:46:19,769 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-02-02 08:46:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:20,043 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-02 08:46:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:46:20,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-02 08:46:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:20,044 INFO L225 Difference]: With dead ends: 69 [2018-02-02 08:46:20,044 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 08:46:20,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:46:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 08:46:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-02-02 08:46:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 08:46:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 08:46:20,047 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-02-02 08:46:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:20,047 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 08:46:20,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:46:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 08:46:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:46:20,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:20,047 INFO L351 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-02-02 08:46:20,048 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:20,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1820306802, now seen corresponding path program 1 times [2018-02-02 08:46:20,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:20,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:20,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:20,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:20,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:20,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:20,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:20,265 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:46:20,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:20,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:20,332 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-02-02 08:46:20,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:46:20,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:20,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:20,382 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-02-02 08:46:20,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:46:20,423 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-02-02 08:46:20,424 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-02-02 08:46:20,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,430 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-02-02 08:46:20,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:46:20,476 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-02-02 08:46:20,478 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-02-02 08:46:20,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,487 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-02-02 08:46:20,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:46:20,641 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-02-02 08:46:20,643 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-02-02 08:46:20,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:20,651 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-02-02 08:46:20,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:20,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:20,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:20,662 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-02 08:46:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:20,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:20,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-02-02 08:46:20,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:46:20,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:46:20,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:46:20,734 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 26 states. [2018-02-02 08:46:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:22,290 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-02 08:46:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:46:22,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-02-02 08:46:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:22,291 INFO L225 Difference]: With dead ends: 82 [2018-02-02 08:46:22,291 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 08:46:22,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=1494, Unknown=1, NotChecked=0, Total=1722 [2018-02-02 08:46:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 08:46:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-02-02 08:46:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 08:46:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-02 08:46:22,297 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2018-02-02 08:46:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:22,297 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-02 08:46:22,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:46:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-02 08:46:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:46:22,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:22,297 INFO L351 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-02-02 08:46:22,297 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1820393708, now seen corresponding path program 1 times [2018-02-02 08:46:22,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:22,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:22,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:22,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:22,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:22,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:22,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:22,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:46:22,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:46:22,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:46:22,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:46:22,455 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 12 states. [2018-02-02 08:46:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:22,669 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-02-02 08:46:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:46:22,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 08:46:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:22,670 INFO L225 Difference]: With dead ends: 135 [2018-02-02 08:46:22,670 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 08:46:22,670 INFO L554 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-02-02 08:46:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 08:46:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2018-02-02 08:46:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 08:46:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-02-02 08:46:22,677 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 28 [2018-02-02 08:46:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:22,677 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-02-02 08:46:22,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:46:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-02-02 08:46:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:46:22,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:22,679 INFO L351 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-02-02 08:46:22,679 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2051871762, now seen corresponding path program 1 times [2018-02-02 08:46:22,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:22,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:22,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:22,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:22,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:22,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:22,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:22,848 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:46:22,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:22,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:22,880 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-02-02 08:46:22,882 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-02-02 08:46:22,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:22,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:22,887 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-02-02 08:46:22,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 08:46:23,016 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-02-02 08:46:23,024 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-02-02 08:46:23,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:23,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:23,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:23,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-02 08:46:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:23,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:23,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-02-02 08:46:23,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 08:46:23,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 08:46:23,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:46:23,147 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 21 states. [2018-02-02 08:46:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:24,038 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-02-02 08:46:24,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:46:24,039 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-02 08:46:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:24,039 INFO L225 Difference]: With dead ends: 135 [2018-02-02 08:46:24,040 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 08:46:24,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:46:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 08:46:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2018-02-02 08:46:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 08:46:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-02-02 08:46:24,045 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-02-02 08:46:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:24,045 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-02-02 08:46:24,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 08:46:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-02-02 08:46:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:46:24,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:24,046 INFO L351 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-02-02 08:46:24,046 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:24,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1662272263, now seen corresponding path program 1 times [2018-02-02 08:46:24,047 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:24,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:24,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:24,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:24,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:24,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:24,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:24,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:24,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:24,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:24,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:24,140 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 6 states. [2018-02-02 08:46:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:24,206 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-02 08:46:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:46:24,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 08:46:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:24,207 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:46:24,207 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 08:46:24,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:46:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 08:46:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 08:46:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 08:46:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-02-02 08:46:24,210 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 30 [2018-02-02 08:46:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:24,211 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-02-02 08:46:24,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-02-02 08:46:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:46:24,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:24,213 INFO L351 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-02-02 08:46:24,213 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash -795993964, now seen corresponding path program 2 times [2018-02-02 08:46:24,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:24,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:24,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:24,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:24,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:24,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:24,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:24,471 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:46:24,485 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:46:24,502 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:24,506 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:24,508 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:46:24,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:24,512 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-02-02 08:46:24,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:24,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:24,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:46:24,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:46:24,542 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-02-02 08:46:24,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:24,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:24,547 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-02-02 08:46:24,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-02-02 08:46:24,713 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 22 treesize of output 18 [2018-02-02 08:46:24,726 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-02-02 08:46:24,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:24,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:24,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:24,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-02 08:46:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:24,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:24,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-02 08:46:24,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:46:24,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:46:24,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:46:24,815 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 26 states. [2018-02-02 08:46:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:25,751 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-02 08:46:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:46:25,751 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-02 08:46:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:25,752 INFO L225 Difference]: With dead ends: 99 [2018-02-02 08:46:25,752 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 08:46:25,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 08:46:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 08:46:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2018-02-02 08:46:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 08:46:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-02 08:46:25,755 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2018-02-02 08:46:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:25,755 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-02 08:46:25,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:46:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-02 08:46:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 08:46:25,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:25,756 INFO L351 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-02-02 08:46:25,757 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:46:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash 184039152, now seen corresponding path program 2 times [2018-02-02 08:46:25,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:25,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:25,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:25,758 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:46:25,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:25,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:26,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:26,057 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:46:26,062 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:46:26,069 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:26,074 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:26,076 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:46:26,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:26,082 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-02-02 08:46:26,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,092 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-02-02 08:46:26,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:46:26,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:26,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:26,144 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-02-02 08:46:26,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,149 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-02-02 08:46:26,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 08:46:26,190 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-02-02 08:46:26,191 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-02-02 08:46:26,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,197 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-02-02 08:46:26,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-02 08:46:26,224 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-02-02 08:46:26,225 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-02-02 08:46:26,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,233 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-02-02 08:46:26,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-02 08:46:26,520 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-02-02 08:46:26,522 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-02-02 08:46:26,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:26,532 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-02-02 08:46:26,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:26,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:26,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:26,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-02 08:46:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:26,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:26,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-02 08:46:26,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 08:46:26,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 08:46:26,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:46:26,661 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 29 states. [2018-02-02 08:46:31,953 WARN L146 SmtUtils]: Spent 2665ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-02-02 08:46:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:33,968 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-02-02 08:46:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:46:33,969 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2018-02-02 08:46:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:33,970 INFO L225 Difference]: With dead ends: 72 [2018-02-02 08:46:33,970 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 08:46:33,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 08:46:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 08:46:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 08:46:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 08:46:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 08:46:33,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-02-02 08:46:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:33,971 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 08:46:33,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 08:46:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 08:46:33,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 08:46:33,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:46:33 BoogieIcfgContainer [2018-02-02 08:46:33,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:46:33,976 INFO L168 Benchmark]: Toolchain (without parser) took 16188.19 ms. Allocated memory was 404.2 MB in the beginning and 747.1 MB in the end (delta: 342.9 MB). Free memory was 359.6 MB in the beginning and 453.2 MB in the end (delta: -93.6 MB). Peak memory consumption was 249.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:33,977 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:46:33,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.26 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:33,978 INFO L168 Benchmark]: Boogie Preprocessor took 28.71 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:33,978 INFO L168 Benchmark]: RCFGBuilder took 201.26 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 327.6 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:33,978 INFO L168 Benchmark]: TraceAbstraction took 15789.21 ms. Allocated memory was 404.2 MB in the beginning and 747.1 MB in the end (delta: 342.9 MB). Free memory was 326.3 MB in the beginning and 453.2 MB in the end (delta: -126.9 MB). Peak memory consumption was 216.0 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:33,979 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.16 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.26 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.71 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 201.26 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 327.6 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15789.21 ms. Allocated memory was 404.2 MB in the beginning and 747.1 MB in the end (delta: 342.9 MB). Free memory was 326.3 MB in the beginning and 453.2 MB in the end (delta: -126.9 MB). Peak memory consumption was 216.0 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 9 error locations. SAFE Result, 15.7s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 508 SDtfs, 963 SDslu, 2787 SDs, 0 SdLazy, 2343 SolverSat, 237 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 110 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 457 ConstructedInterpolants, 44 QuantifiedInterpolants, 140919 SizeOfPredicates, 52 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10/63 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-46-33-986.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-46-33-986.csv Received shutdown request...