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/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:11:36,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:11:36,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:11:36,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:11:36,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:11:36,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:11:36,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:11:36,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:11:36,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:11:36,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:11:36,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:11:36,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:11:36,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:11:36,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:11:36,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:11:36,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:11:36,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:11:36,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:11:36,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:11:36,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:11:36,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:11:36,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:11:36,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:11:36,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:11:36,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:11:36,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:11:36,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:11:36,198 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:11:36,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:11:36,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:11:36,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:11:36,199 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:11:36,208 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:11:36,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:11:36,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:11:36,209 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:11:36,209 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:11:36,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:11:36,209 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:11:36,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:11:36,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:11:36,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:11:36,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:11:36,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:11:36,211 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:11:36,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:11:36,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:11:36,212 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:11:36,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:11:36,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:11:36,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:11:36,251 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:11:36,254 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:11:36,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:11:36,256 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:11:36,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:11:36,386 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:11:36,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:11:36,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:11:36,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:11:36,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:11:36,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c28f40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36, skipping insertion in model container [2018-02-04 12:11:36,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,403 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:11:36,432 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:11:36,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:11:36,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:11:36,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36 WrapperNode [2018-02-04 12:11:36,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:11:36,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:11:36,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:11:36,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:11:36,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (1/1) ... [2018-02-04 12:11:36,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:11:36,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:11:36,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:11:36,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:11:36,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (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:11:36,586 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:11:36,587 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:11:36,587 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-02-04 12:11:36,587 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:11:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:11:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:11:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:11:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:11:36,587 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:11:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:11:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-02-04 12:11:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:11:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:11:36,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:11:36,703 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:11:36,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:11:36 BoogieIcfgContainer [2018-02-04 12:11:36,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:11:36,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:11:36,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:11:36,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:11:36,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:11:36" (1/3) ... [2018-02-04 12:11:36,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be66165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:11:36, skipping insertion in model container [2018-02-04 12:11:36,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:36" (2/3) ... [2018-02-04 12:11:36,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be66165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:11:36, skipping insertion in model container [2018-02-04 12:11:36,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:11:36" (3/3) ... [2018-02-04 12:11:36,709 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:11:36,715 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:11:36,720 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 12:11:36,754 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:11:36,754 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:11:36,754 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:11:36,754 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:11:36,754 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:11:36,755 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:11:36,755 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:11:36,755 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:11:36,756 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:11:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 12:11:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:11:36,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:36,776 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:36,776 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-02-04 12:11:36,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:36,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:36,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:36,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:36,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:36,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:36,910 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:11:36,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:36,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:11:36,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:11:36,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:11:36,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:11:36,922 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 12:11:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:36,992 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 12:11:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:11:36,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 12:11:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:36,999 INFO L225 Difference]: With dead ends: 39 [2018-02-04 12:11:37,000 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 12:11:37,001 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:11:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 12:11:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 12:11:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 12:11:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 12:11:37,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-02-04 12:11:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:37,069 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 12:11:37,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:11:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 12:11:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:11:37,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:37,069 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:37,070 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-02-04 12:11:37,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:37,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:37,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,071 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:37,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:37,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:37,169 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:11:37,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:37,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:11:37,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:11:37,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:11:37,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:37,172 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 12:11:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:37,215 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 12:11:37,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:11:37,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 12:11:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:37,216 INFO L225 Difference]: With dead ends: 35 [2018-02-04 12:11:37,216 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 12:11:37,217 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:11:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 12:11:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 12:11:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 12:11:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 12:11:37,221 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-02-04 12:11:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:37,221 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 12:11:37,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:11:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 12:11:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:11:37,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:37,221 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:37,221 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-02-04 12:11:37,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:37,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:37,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,223 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:37,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:37,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:37,269 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:11:37,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:37,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:11:37,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:11:37,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:11:37,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:37,271 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 12:11:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:37,327 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 12:11:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:11:37,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 12:11:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:37,328 INFO L225 Difference]: With dead ends: 32 [2018-02-04 12:11:37,329 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 12:11:37,329 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:11:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 12:11:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 12:11:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 12:11:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 12:11:37,332 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-04 12:11:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:37,332 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 12:11:37,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:11:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 12:11:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:11:37,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:37,333 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:37,333 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-02-04 12:11:37,333 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:37,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:37,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:37,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:37,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:37,432 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:11:37,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:37,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:11:37,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:11:37,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:11:37,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:11:37,434 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-02-04 12:11:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:37,514 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 12:11:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:11:37,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 12:11:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:37,516 INFO L225 Difference]: With dead ends: 43 [2018-02-04 12:11:37,516 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 12:11:37,517 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:11:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 12:11:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 12:11:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 12:11:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-02-04 12:11:37,519 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-02-04 12:11:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:37,519 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-02-04 12:11:37,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:11:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-02-04 12:11:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:11:37,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:37,520 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:37,520 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-02-04 12:11:37,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:37,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:37,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:37,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:37,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:37,623 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:11:37,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:37,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:11:37,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:11:37,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:11:37,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:11:37,624 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-02-04 12:11:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:37,713 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 12:11:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:11:37,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 12:11:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:37,714 INFO L225 Difference]: With dead ends: 55 [2018-02-04 12:11:37,714 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 12:11:37,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:11:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 12:11:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-02-04 12:11:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:11:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 12:11:37,717 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-02-04 12:11:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:37,717 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 12:11:37,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:11:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 12:11:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:11:37,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:37,718 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:37,718 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-02-04 12:11:37,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:37,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:37,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:37,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:37,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:37,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:37,880 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:11:37,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:37,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:37,949 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:11:37,951 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:11:37,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:37,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:37,957 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:11:37,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:11:38,053 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:11:38,072 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:11:38,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:38,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:38,088 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:11:38,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 12:11:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:38,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:38,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-02-04 12:11:38,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:11:38,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:11:38,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:11:38,177 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-02-04 12:11:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:42,397 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-02-04 12:11:42,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:11:42,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-02-04 12:11:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:42,399 INFO L225 Difference]: With dead ends: 108 [2018-02-04 12:11:42,399 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 12:11:42,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:11:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 12:11:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 58. [2018-02-04 12:11:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:11:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 12:11:42,405 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-02-04 12:11:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:42,405 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 12:11:42,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:11:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 12:11:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:11:42,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:42,406 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:11:42,407 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-02-04 12:11:42,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:42,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:42,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:42,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:42,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:42,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:42,473 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:11:42,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:42,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:11:42,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:11:42,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:11:42,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:11:42,474 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2018-02-04 12:11:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:42,505 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-02-04 12:11:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:11:42,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 12:11:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:42,511 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:11:42,511 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 12:11:42,511 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:11:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 12:11:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 12:11:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 12:11:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 12:11:42,513 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-02-04 12:11:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:42,513 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 12:11:42,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:11:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 12:11:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:11:42,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:42,514 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:42,514 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-02-04 12:11:42,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:42,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:42,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:42,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:42,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:42,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:42,744 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:11:42,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:42,744 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:11:42,750 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:11:42,763 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:11:42,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:11:42,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:42,767 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:11:42,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:42,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:42,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:11:42,790 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:11:42,792 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:11:42,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:42,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:42,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:42,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 12:11:42,872 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:11:42,878 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:11:42,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:42,888 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:11:42,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-04 12:11:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:42,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:42,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 12:11:42,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:11:42,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:11:42,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:11:42,940 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 18 states. [2018-02-04 12:11:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:43,511 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-04 12:11:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:11:43,511 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-04 12:11:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:43,511 INFO L225 Difference]: With dead ends: 75 [2018-02-04 12:11:43,512 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 12:11:43,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:11:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 12:11:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-02-04 12:11:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 12:11:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 12:11:43,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2018-02-04 12:11:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:43,514 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 12:11:43,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:11:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 12:11:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:11:43,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:43,514 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:43,515 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:11:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2006324798, now seen corresponding path program 1 times [2018-02-04 12:11:43,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:43,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:43,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:43,515 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:11:43,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:43,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:43,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:43,665 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:11:43,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:43,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:43,695 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:11:43,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:43,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:43,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:11:43,704 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 15 treesize of output 12 [2018-02-04 12:11:43,705 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 12 treesize of output 11 [2018-02-04 12:11:43,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:43,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:43,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:43,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 12:11:43,744 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 23 treesize of output 18 [2018-02-04 12:11:43,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 12:11:43,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:43,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:43,765 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:11:43,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-02-04 12:11:43,820 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 12:11:43,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:43,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 12:11:43,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:11:43,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:43,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:43,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:43,835 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2018-02-04 12:11:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:43,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:43,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-04 12:11:43,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:11:43,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:11:43,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:11:43,910 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 21 states. [2018-02-04 12:11:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:44,275 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-02-04 12:11:44,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:11:44,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-02-04 12:11:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:44,275 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:11:44,276 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:11:44,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:11:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:11:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:11:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:11:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:11:44,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-02-04 12:11:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:44,276 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:11:44,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:11:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:11:44,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:11:44,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:11:44 BoogieIcfgContainer [2018-02-04 12:11:44,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:11:44,281 INFO L168 Benchmark]: Toolchain (without parser) took 7894.90 ms. Allocated memory was 400.0 MB in the beginning and 674.8 MB in the end (delta: 274.7 MB). Free memory was 356.7 MB in the beginning and 478.6 MB in the end (delta: -121.9 MB). Peak memory consumption was 152.8 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:44,282 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 400.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:11:44,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.99 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 346.1 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:11:44,283 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 400.0 MB. Free memory was 346.1 MB in the beginning and 343.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:11:44,283 INFO L168 Benchmark]: RCFGBuilder took 152.87 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 326.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:44,283 INFO L168 Benchmark]: TraceAbstraction took 7576.50 ms. Allocated memory was 400.0 MB in the beginning and 674.8 MB in the end (delta: 274.7 MB). Free memory was 326.3 MB in the beginning and 478.6 MB in the end (delta: -152.3 MB). Peak memory consumption was 122.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:44,284 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 400.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.99 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 346.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 400.0 MB. Free memory was 346.1 MB in the beginning and 343.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 152.87 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 326.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7576.50 ms. Allocated memory was 400.0 MB in the beginning and 674.8 MB in the end (delta: 274.7 MB). Free memory was 326.3 MB in the beginning and 478.6 MB in the end (delta: -152.3 MB). Peak memory consumption was 122.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: 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 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. SAFE Result, 7.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 467 SDslu, 964 SDs, 0 SdLazy, 889 SolverSat, 158 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, 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, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 248 ConstructedInterpolants, 14 QuantifiedInterpolants, 67446 SizeOfPredicates, 25 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/74 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-11-44-290.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-11-44-290.csv Received shutdown request...