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_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:10:03,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:10:03,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:10:03,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:10:03,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:10:03,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:10:03,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:10:03,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:10:03,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:10:03,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:10:03,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:10:03,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:10:03,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:10:03,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:10:03,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:10:03,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:10:03,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:10:03,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:10:03,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:10:03,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:10:03,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:10:03,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:10:03,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:10:03,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:10:03,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:10:03,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:10:03,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:10:03,746 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:10:03,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:10:03,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:10:03,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:10:03,747 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:10:03,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:10:03,757 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:10:03,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:10:03,758 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:10:03,758 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:10:03,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:10:03,758 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:10:03,758 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:10:03,758 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:10:03,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:10:03,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:10:03,759 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:10:03,759 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:10:03,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:10:03,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:10:03,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:10:03,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:10:03,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:10:03,760 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:10:03,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:10:03,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:10:03,760 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:10:03,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:10:03,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:10:03,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:10:03,799 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:10:03,802 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:10:03,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:10:03,804 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:10:03,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:03,951 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:10:03,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:10:03,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:03,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:10:03,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:10:03,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:03" (1/1) ... [2018-02-04 12:10:03,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31db4c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:03, skipping insertion in model container [2018-02-04 12:10:03,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:03" (1/1) ... [2018-02-04 12:10:03,975 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:04,002 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:04,084 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:04,096 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:04,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04 WrapperNode [2018-02-04 12:10:04,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:04,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:10:04,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:10:04,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:10:04,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (1/1) ... [2018-02-04 12:10:04,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:10:04,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:10:04,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:10:04,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:10:04,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (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:10:04,162 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:10:04,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:10:04,163 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-02-04 12:10:04,163 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:10:04,163 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:10:04,164 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:10:04,283 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:10:04,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:04 BoogieIcfgContainer [2018-02-04 12:10:04,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:10:04,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:10:04,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:10:04,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:10:04,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:10:03" (1/3) ... [2018-02-04 12:10:04,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf7d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:04, skipping insertion in model container [2018-02-04 12:10:04,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:04" (2/3) ... [2018-02-04 12:10:04,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf7d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:04, skipping insertion in model container [2018-02-04 12:10:04,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:04" (3/3) ... [2018-02-04 12:10:04,289 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:04,295 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:10:04,299 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 12:10:04,330 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:10:04,331 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:10:04,331 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:10:04,331 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:10:04,331 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:10:04,331 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:10:04,331 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:10:04,331 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:10:04,332 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:10:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-04 12:10:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:10:04,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:04,354 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:04,354 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-02-04 12:10:04,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:04,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:04,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:04,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:04,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:04,483 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:10:04,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:04,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:04,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:04,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:04,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:04,498 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-02-04 12:10:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:04,546 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 12:10:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:04,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 12:10:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:04,606 INFO L225 Difference]: With dead ends: 33 [2018-02-04 12:10:04,606 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 12:10:04,608 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-04 12:10:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 12:10:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 12:10:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 12:10:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-02-04 12:10:04,630 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-02-04 12:10:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:04,631 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-02-04 12:10:04,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-02-04 12:10:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:10:04,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:04,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:04,631 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-02-04 12:10:04,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:04,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:04,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:04,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:04,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:04,709 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:10:04,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:04,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:10:04,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:10:04,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:10:04,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:04,712 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-02-04 12:10:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:04,745 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-02-04 12:10:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:04,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 12:10:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:04,746 INFO L225 Difference]: With dead ends: 29 [2018-02-04 12:10:04,746 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 12:10:04,747 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-04 12:10:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 12:10:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 12:10:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 12:10:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-02-04 12:10:04,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-02-04 12:10:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:04,750 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-02-04 12:10:04,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:10:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-02-04 12:10:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:10:04,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:04,751 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:10:04,751 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-02-04 12:10:04,751 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:04,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:04,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:04,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:04,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:04,800 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:10:04,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:04,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:10:04,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:10:04,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:10:04,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:04,802 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-02-04 12:10:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:04,836 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-02-04 12:10:04,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:10:04,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 12:10:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:04,837 INFO L225 Difference]: With dead ends: 28 [2018-02-04 12:10:04,837 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 12:10:04,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 12:10:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 12:10:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 12:10:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 12:10:04,840 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 12:10:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:04,841 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 12:10:04,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:10:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 12:10:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:10:04,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:04,842 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:10:04,842 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-02-04 12:10:04,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:04,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:04,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:04,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:04,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:04,935 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:10:04,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:04,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:10:04,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:10:04,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:10:04,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:10:04,936 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-04 12:10:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:05,019 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-02-04 12:10:05,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:10:05,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 12:10:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:05,023 INFO L225 Difference]: With dead ends: 37 [2018-02-04 12:10:05,023 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 12:10:05,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:10:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 12:10:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-02-04 12:10:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 12:10:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-02-04 12:10:05,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-02-04 12:10:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:05,027 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-02-04 12:10:05,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:10:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-02-04 12:10:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:10:05,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:05,028 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:05,028 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-02-04 12:10:05,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:05,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:05,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:05,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:05,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:05,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:05,060 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-04 12:10:05,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:05,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:05,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:10:05,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:10:05,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:10:05,061 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-02-04 12:10:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:05,070 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-02-04 12:10:05,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:10:05,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-04 12:10:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:05,071 INFO L225 Difference]: With dead ends: 32 [2018-02-04 12:10:05,071 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 12:10:05,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:10:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 12:10:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 12:10:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 12:10:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-02-04 12:10:05,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-02-04 12:10:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:05,074 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-02-04 12:10:05,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:10:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-02-04 12:10:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:10:05,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:05,075 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] [2018-02-04 12:10:05,076 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-02-04 12:10:05,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:05,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:05,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:05,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:05,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:05,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:05,176 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:10:05,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:05,177 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:10:05,185 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:05,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:05,274 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 11 treesize of output 8 [2018-02-04 12:10:05,282 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 8 treesize of output 7 [2018-02-04 12:10:05,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 12:10:05,320 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 15 treesize of output 11 [2018-02-04 12:10:05,322 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 11 treesize of output 3 [2018-02-04 12:10:05,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 12:10:05,339 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-04 12:10:05,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:10:05,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2018-02-04 12:10:05,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:10:05,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:10:05,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:10:05,365 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2018-02-04 12:10:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:05,640 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-02-04 12:10:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:10:05,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-04 12:10:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:05,641 INFO L225 Difference]: With dead ends: 97 [2018-02-04 12:10:05,642 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 12:10:05,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:10:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 12:10:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2018-02-04 12:10:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 12:10:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-02-04 12:10:05,647 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-02-04 12:10:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:05,647 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-02-04 12:10:05,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:10:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-02-04 12:10:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:10:05,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:05,648 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] [2018-02-04 12:10:05,649 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-02-04 12:10:05,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:05,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:05,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:05,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:05,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:05,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:05,845 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:10:05,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:05,845 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:10:05,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:05,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:05,885 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-04 12:10:05,887 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-04 12:10:05,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:05,893 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-04 12:10:05,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:10:05,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 12:10:05,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:10:05,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:05,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:05,983 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-04 12:10:05,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 12:10:06,093 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:10:06,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:06,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-02-04 12:10:06,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:10:06,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:10:06,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:10:06,111 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 18 states. [2018-02-04 12:10:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:06,634 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-04 12:10:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:10:06,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-02-04 12:10:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:06,634 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:10:06,635 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:10:06,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:10:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:10:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-02-04 12:10:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 12:10:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-04 12:10:06,639 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-02-04 12:10:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:06,639 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-04 12:10:06,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:10:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-04 12:10:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:06,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:06,640 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-04 12:10:06,640 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-02-04 12:10:06,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:06,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:06,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:06,641 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:06,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:06,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:06,705 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:10:06,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:06,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:10:06,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:06,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:06,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:06,706 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-04 12:10:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:06,749 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-02-04 12:10:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:10:06,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:10:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:06,750 INFO L225 Difference]: With dead ends: 96 [2018-02-04 12:10:06,750 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:10:06,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:10:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:10:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-04 12:10:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:10:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-04 12:10:06,758 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-02-04 12:10:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:06,759 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-04 12:10:06,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-04 12:10:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:06,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:06,760 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-04 12:10:06,761 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-02-04 12:10:06,761 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:06,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:06,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:06,761 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:06,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:06,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:06,798 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:10:06,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:06,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:06,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:06,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:06,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:06,803 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2018-02-04 12:10:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:06,840 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-02-04 12:10:06,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:10:06,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 12:10:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:06,841 INFO L225 Difference]: With dead ends: 76 [2018-02-04 12:10:06,841 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 12:10:06,841 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:10:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 12:10:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 12:10:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 12:10:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-04 12:10:06,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 23 [2018-02-04 12:10:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:06,843 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-04 12:10:06,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-04 12:10:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:10:06,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:06,844 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:06,844 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 2 times [2018-02-04 12:10:06,844 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:06,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:06,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:06,845 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:06,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:06,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:07,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:07,099 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:10:07,104 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:10:07,122 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:10:07,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:07,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:07,127 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:10:07,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:07,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:07,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:10:07,153 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-04 12:10:07,156 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-04 12:10:07,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:07,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:07,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:07,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 12:10:07,245 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-04 12:10:07,250 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-04 12:10:07,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:07,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:07,258 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-04 12:10:07,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-04 12:10:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:07,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:07,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 12:10:07,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:10:07,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:10:07,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:10:07,344 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 20 states. [2018-02-04 12:10:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:07,814 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 12:10:07,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:10:07,814 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-02-04 12:10:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:07,814 INFO L225 Difference]: With dead ends: 31 [2018-02-04 12:10:07,814 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:10:07,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:10:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:10:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:10:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:10:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:10:07,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-04 12:10:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:07,815 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:10:07,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:10:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:10:07,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:10:07,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:10:07 BoogieIcfgContainer [2018-02-04 12:10:07,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:10:07,819 INFO L168 Benchmark]: Toolchain (without parser) took 3868.11 ms. Allocated memory was 403.7 MB in the beginning and 688.9 MB in the end (delta: 285.2 MB). Free memory was 360.6 MB in the beginning and 655.3 MB in the end (delta: -294.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:10:07,820 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:10:07,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.84 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 350.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:07,820 INFO L168 Benchmark]: Boogie Preprocessor took 22.14 ms. Allocated memory is still 403.7 MB. Free memory was 350.0 MB in the beginning and 348.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:07,820 INFO L168 Benchmark]: RCFGBuilder took 160.23 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 333.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:07,820 INFO L168 Benchmark]: TraceAbstraction took 3534.11 ms. Allocated memory was 403.7 MB in the beginning and 688.9 MB in the end (delta: 285.2 MB). Free memory was 332.0 MB in the beginning and 655.3 MB in the end (delta: -323.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:10:07,821 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.14 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.84 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 350.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.14 ms. Allocated memory is still 403.7 MB. Free memory was 350.0 MB in the beginning and 348.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 160.23 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 333.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3534.11 ms. Allocated memory was 403.7 MB in the beginning and 688.9 MB in the end (delta: 285.2 MB). Free memory was 332.0 MB in the beginning and 655.3 MB in the end (delta: -323.3 MB). There was no memory consumed. 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: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 3.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 356 SDslu, 923 SDs, 0 SdLazy, 746 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred 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, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 251 ConstructedInterpolants, 15 QuantifiedInterpolants, 39127 SizeOfPredicates, 25 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 9/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_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-10-07-826.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-10-07-826.csv Received shutdown request...