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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:05:29,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:05:29,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:05:29,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:05:29,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:05:29,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:05:29,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:05:29,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:05:29,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:05:29,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:05:29,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:05:29,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:05:29,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:05:29,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:05:29,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:05:29,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:05:29,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:05:29,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:05:29,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:05:29,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:05:29,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:05:29,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:05:29,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:05:29,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:05:29,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:05:29,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:05:29,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:05:29,074 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:05:29,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:05:29,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:05:29,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:05:29,075 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:05:29,084 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:05:29,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:05:29,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:05:29,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:05:29,085 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:05:29,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:05:29,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:05:29,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:05:29,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:05:29,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:05:29,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:05:29,086 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:05:29,086 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:05:29,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:05:29,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:05:29,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:05:29,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:05:29,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:05:29,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:05:29,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:05:29,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:05:29,088 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:05:29,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:05:29,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:05:29,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:05:29,125 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:05:29,130 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:05:29,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:05:29,131 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:05:29,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:05:29,277 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:05:29,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:05:29,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:05:29,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:05:29,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:05:29,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3670bcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29, skipping insertion in model container [2018-02-04 12:05:29,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,304 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:05:29,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:05:29,414 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:05:29,425 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:05:29,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29 WrapperNode [2018-02-04 12:05:29,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:05:29,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:05:29,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:05:29,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:05:29,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (1/1) ... [2018-02-04 12:05:29,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:05:29,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:05:29,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:05:29,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:05:29,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (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-04 12:05:29,488 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:05:29,488 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:05:29,488 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-02-04 12:05:29,488 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:05:29,488 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:05:29,488 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:05:29,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:05:29,583 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:05:29,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:05:29 BoogieIcfgContainer [2018-02-04 12:05:29,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:05:29,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:05:29,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:05:29,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:05:29,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:05:29" (1/3) ... [2018-02-04 12:05:29,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14137f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:05:29, skipping insertion in model container [2018-02-04 12:05:29,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:29" (2/3) ... [2018-02-04 12:05:29,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14137f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:05:29, skipping insertion in model container [2018-02-04 12:05:29,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:05:29" (3/3) ... [2018-02-04 12:05:29,587 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:05:29,592 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:05:29,596 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 12:05:29,623 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:05:29,623 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:05:29,623 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:05:29,623 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:05:29,623 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:05:29,623 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:05:29,624 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:05:29,624 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:05:29,624 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:05:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 12:05:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:05:29,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:29,638 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:29,638 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-02-04 12:05:29,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:29,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:29,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:29,671 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:29,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:29,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:29,764 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-04 12:05:29,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:29,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:05:29,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:05:29,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:05:29,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:05:29,778 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-02-04 12:05:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:29,830 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 12:05:29,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:05:29,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 12:05:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:29,836 INFO L225 Difference]: With dead ends: 33 [2018-02-04 12:05:29,836 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 12:05:29,837 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-04 12:05:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 12:05:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 12:05:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 12:05:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-02-04 12:05:29,907 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-02-04 12:05:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:29,907 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-02-04 12:05:29,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:05:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-02-04 12:05:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:05:29,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:29,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:29,908 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-02-04 12:05:29,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:29,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:29,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:29,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:29,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:29,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:29,930 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-04 12:05:29,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:29,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:05:29,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:05:29,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:05:29,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:05:29,933 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-02-04 12:05:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:29,955 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-02-04 12:05:29,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:05:29,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 12:05:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:29,956 INFO L225 Difference]: With dead ends: 28 [2018-02-04 12:05:29,956 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 12:05:29,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:05:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 12:05:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-02-04 12:05:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 12:05:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-04 12:05:29,960 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-04 12:05:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:29,960 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-04 12:05:29,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:05:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-04 12:05:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:05:29,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:29,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:29,961 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-02-04 12:05:29,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:29,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:29,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:29,963 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:29,963 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:29,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:30,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-04 12:05:30,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:30,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:05:30,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:05:30,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:05:30,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:05:30,040 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-02-04 12:05:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:30,110 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-04 12:05:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:05:30,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-04 12:05:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:30,111 INFO L225 Difference]: With dead ends: 25 [2018-02-04 12:05:30,111 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 12:05:30,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:05:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 12:05:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 12:05:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 12:05:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-04 12:05:30,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-02-04 12:05:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:30,113 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-04 12:05:30,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:05:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-04 12:05:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:05:30,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:30,114 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:30,114 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:30,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-02-04 12:05:30,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:30,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:30,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:30,197 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-04 12:05:30,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:30,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:05:30,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:05:30,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:05:30,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:30,199 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-02-04 12:05:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:30,282 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-04 12:05:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:05:30,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 12:05:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:30,284 INFO L225 Difference]: With dead ends: 31 [2018-02-04 12:05:30,284 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 12:05:30,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:05:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 12:05:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-02-04 12:05:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 12:05:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 12:05:30,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 12:05:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:30,287 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 12:05:30,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:05:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 12:05:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:05:30,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:30,288 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:30,288 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-02-04 12:05:30,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:30,288 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:30,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:30,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:30,380 INFO L213 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-04 12:05:30,385 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:30,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:30,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 12:05:30,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:05:30,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:05:30,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:05:30,449 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-04 12:05:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:30,497 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 12:05:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:05:30,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 12:05:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:30,498 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:05:30,498 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:05:30,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:05:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:05:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-04 12:05:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 12:05:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 12:05:30,501 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-04 12:05:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:30,501 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 12:05:30,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:05:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 12:05:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:05:30,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:30,502 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:30,502 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-02-04 12:05:30,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:30,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:30,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:30,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:30,599 INFO L213 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-04 12:05:30,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:30,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:30,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 12:05:30,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:05:30,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:05:30,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:05:30,675 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-04 12:05:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:30,773 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 12:05:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:05:30,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-04 12:05:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:30,774 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:05:30,775 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:05:30,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:05:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:05:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-02-04 12:05:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 12:05:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 12:05:30,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-04 12:05:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:30,787 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 12:05:30,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:05:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 12:05:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:05:30,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:30,788 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:30,788 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-02-04 12:05:30,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:30,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:30,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,789 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:30,963 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-04 12:05:30,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:30,963 INFO L213 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-04 12:05:30,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:30,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:31,011 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-04 12:05:31,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:31,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:31,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-02-04 12:05:31,160 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-04 12:05:31,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:31,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 12:05:31,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:05:31,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:05:31,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:05:31,196 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 22 states. [2018-02-04 12:05:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:31,445 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-04 12:05:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:05:31,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-02-04 12:05:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:31,446 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:05:31,446 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:05:31,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:05:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:05:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 12:05:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 12:05:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 12:05:31,452 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-02-04 12:05:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:31,452 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 12:05:31,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:05:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 12:05:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:05:31,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:31,453 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] [2018-02-04 12:05:31,453 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-02-04 12:05:31,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:31,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:31,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:31,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:31,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:31,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:31,503 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-04 12:05:31,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:31,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:05:31,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:05:31,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:05:31,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:05:31,504 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-02-04 12:05:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:31,523 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 12:05:31,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:05:31,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 12:05:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:31,524 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:05:31,524 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:05:31,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:05:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:05:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-02-04 12:05:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:05:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 12:05:31,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-02-04 12:05:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:31,529 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 12:05:31,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:05:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 12:05:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:05:31,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:31,531 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] [2018-02-04 12:05:31,531 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-02-04 12:05:31,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:31,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:31,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:31,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:31,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:31,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:31,573 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-04 12:05:31,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:05:31,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:05:31,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:05:31,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:05:31,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:05:31,574 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 4 states. [2018-02-04 12:05:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:31,592 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-02-04 12:05:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:05:31,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 12:05:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:31,593 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:05:31,593 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 12:05:31,593 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-04 12:05:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 12:05:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 12:05:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 12:05:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-02-04 12:05:31,594 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-02-04 12:05:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:31,594 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-02-04 12:05:31,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:05:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-02-04 12:05:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:05:31,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:31,595 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:31,595 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 12:05:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 964772623, now seen corresponding path program 2 times [2018-02-04 12:05:31,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:31,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:31,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:31,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:31,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:31,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:31,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:31,806 INFO L213 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-04 12:05:31,810 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:05:31,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:05:31,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:31,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:31,831 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-04 12:05:31,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:31,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:31,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-02-04 12:05:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:32,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:32,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-02-04 12:05:32,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 12:05:32,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 12:05:32,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:05:32,052 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 27 states. [2018-02-04 12:05:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:32,508 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 12:05:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:05:32,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 24 [2018-02-04 12:05:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:32,508 INFO L225 Difference]: With dead ends: 29 [2018-02-04 12:05:32,508 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:05:32,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:05:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:05:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:05:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:05:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:05:32,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-02-04 12:05:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:32,510 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:05:32,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 12:05:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:05:32,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:05:32,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:05:32 BoogieIcfgContainer [2018-02-04 12:05:32,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:05:32,513 INFO L168 Benchmark]: Toolchain (without parser) took 3236.50 ms. Allocated memory was 404.8 MB in the beginning and 660.1 MB in the end (delta: 255.3 MB). Free memory was 362.8 MB in the beginning and 435.6 MB in the end (delta: -72.9 MB). Peak memory consumption was 182.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:32,514 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:05:32,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.21 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 352.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:32,515 INFO L168 Benchmark]: Boogie Preprocessor took 22.29 ms. Allocated memory is still 404.8 MB. Free memory was 352.2 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:32,515 INFO L168 Benchmark]: RCFGBuilder took 131.76 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 334.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:32,515 INFO L168 Benchmark]: TraceAbstraction took 2929.43 ms. Allocated memory was 404.8 MB in the beginning and 660.1 MB in the end (delta: 255.3 MB). Free memory was 333.5 MB in the beginning and 435.6 MB in the end (delta: -102.1 MB). Peak memory consumption was 153.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:05:32,517 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.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.21 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 352.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.29 ms. Allocated memory is still 404.8 MB. Free memory was 352.2 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 131.76 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 334.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2929.43 ms. Allocated memory was 404.8 MB in the beginning and 660.1 MB in the end (delta: 255.3 MB). Free memory was 333.5 MB in the beginning and 435.6 MB in the end (delta: -102.1 MB). Peak memory consumption was 153.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 2.8s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219 SDtfs, 219 SDslu, 923 SDs, 0 SdLazy, 667 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, 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, 10 MinimizatonAttempts, 56 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 248 ConstructedInterpolants, 2 QuantifiedInterpolants, 31057 SizeOfPredicates, 30 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 4/38 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_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-05-32-523.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-05-32-523.csv Received shutdown request...