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_SmtInterpol_NoArray.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 17:38:07,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:38:07,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:38:07,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:38:07,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:38:07,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:38:07,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:38:07,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:38:07,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:38:07,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:38:07,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:38:07,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:38:07,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:38:07,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:38:07,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:38:07,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:38:07,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:38:07,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:38:07,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:38:07,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:38:07,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:38:07,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:38:07,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:38:07,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:38:07,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:38:07,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:38:07,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:38:07,827 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:38:07,827 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:38:07,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:38:07,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:38:07,827 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:38:07,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:38:07,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:38:07,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:38:07,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:38:07,837 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:38:07,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:38:07,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:38:07,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:38:07,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:38:07,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:38:07,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:38:07,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:38:07,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:38:07,839 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:38:07,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:38:07,839 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:38:07,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:38:07,876 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:38:07,879 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:38:07,880 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:38:07,880 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:38:07,881 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 17:38:08,020 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:38:08,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:38:08,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:38:08,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:38:08,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:38:08,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb25181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08, skipping insertion in model container [2018-02-04 17:38:08,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,042 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:38:08,070 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:38:08,152 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:38:08,163 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:38:08,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08 WrapperNode [2018-02-04 17:38:08,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:38:08,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:38:08,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:38:08,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:38:08,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (1/1) ... [2018-02-04 17:38:08,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:38:08,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:38:08,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:38:08,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:38:08,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (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 17:38:08,225 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:38:08,225 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:38:08,225 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-02-04 17:38:08,225 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:38:08,225 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:38:08,225 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:38:08,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:38:08,349 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:38:08,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:38:08 BoogieIcfgContainer [2018-02-04 17:38:08,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:38:08,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:38:08,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:38:08,352 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:38:08,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:38:08" (1/3) ... [2018-02-04 17:38:08,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da2e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:38:08, skipping insertion in model container [2018-02-04 17:38:08,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:08" (2/3) ... [2018-02-04 17:38:08,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da2e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:38:08, skipping insertion in model container [2018-02-04 17:38:08,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:38:08" (3/3) ... [2018-02-04 17:38:08,354 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:38:08,359 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:38:08,363 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 17:38:08,395 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:38:08,396 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:38:08,396 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:38:08,396 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:38:08,396 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:38:08,396 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:38:08,396 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:38:08,397 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:38:08,397 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:38:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 17:38:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:38:08,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:08,417 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:08,417 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:08,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-02-04 17:38:08,423 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:08,423 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:08,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:08,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:08,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:08,580 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 17:38:08,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:08,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:38:08,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:38:08,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:38:08,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:38:08,597 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 17:38:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:08,677 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 17:38:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:38:08,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:38:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:08,687 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:38:08,687 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:38:08,688 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 17:38:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:38:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:38:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:38:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:38:08,755 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-02-04 17:38:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:08,755 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:38:08,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:38:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:38:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:38:08,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:08,756 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:08,756 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-02-04 17:38:08,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:08,756 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:08,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:08,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:08,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:08,845 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 17:38:08,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:08,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:38:08,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:08,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:08,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:08,848 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 17:38:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:08,903 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 17:38:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:38:08,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:38:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:08,904 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:38:08,904 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:38:08,905 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 17:38:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:38:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:38:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:38:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 17:38:08,909 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-02-04 17:38:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:08,909 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 17:38:08,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 17:38:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:38:08,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:08,910 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:08,910 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-02-04 17:38:08,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:08,910 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:08,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:08,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:08,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:08,959 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 17:38:08,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:08,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:38:08,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:08,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:08,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:08,960 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 17:38:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:09,000 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 17:38:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:38:09,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:38:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:09,000 INFO L225 Difference]: With dead ends: 32 [2018-02-04 17:38:09,000 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 17:38:09,001 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 17:38:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 17:38:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 17:38:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 17:38:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 17:38:09,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-04 17:38:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:09,003 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 17:38:09,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 17:38:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:38:09,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:09,004 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:09,004 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-02-04 17:38:09,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:09,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:09,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:09,006 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:09,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:09,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:09,096 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 17:38:09,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:09,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:38:09,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:38:09,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:38:09,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:38:09,098 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-02-04 17:38:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:09,183 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 17:38:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:38:09,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 17:38:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:09,186 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:38:09,186 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:38:09,186 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 17:38:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:38:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 17:38:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:38:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-02-04 17:38:09,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-02-04 17:38:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:09,189 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-02-04 17:38:09,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:38:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-02-04 17:38:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:38:09,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:09,190 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 17:38:09,190 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-02-04 17:38:09,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:09,190 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:09,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:09,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:09,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:09,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:09,308 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 17:38:09,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:09,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:38:09,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:38:09,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:38:09,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:38:09,309 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-02-04 17:38:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:09,389 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 17:38:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:38:09,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 17:38:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:09,390 INFO L225 Difference]: With dead ends: 55 [2018-02-04 17:38:09,390 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 17:38:09,391 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 17:38:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 17:38:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-02-04 17:38:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:38:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 17:38:09,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-02-04 17:38:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:09,395 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 17:38:09,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:38:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 17:38:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:38:09,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:09,397 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 17:38:09,397 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-02-04 17:38:09,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:09,397 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:09,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:09,398 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:09,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:09,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:09,538 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 17:38:09,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:09,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:09,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:09,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:09,604 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 17:38:09,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:09,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:09,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:09,634 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 17:38:09,636 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 17:38:09,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:09,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:09,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:09,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:38:09,728 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 17:38:09,733 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 17:38:09,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:09,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:09,744 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 17:38:09,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:38:09,825 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 17:38:09,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:09,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 17:38:09,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:38:09,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:38:09,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:38:09,826 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 18 states. [2018-02-04 17:38:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:10,223 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-02-04 17:38:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:38:10,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-02-04 17:38:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:10,225 INFO L225 Difference]: With dead ends: 103 [2018-02-04 17:38:10,225 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 17:38:10,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:38:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 17:38:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 58. [2018-02-04 17:38:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 17:38:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 17:38:10,232 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-02-04 17:38:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:10,233 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 17:38:10,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:38:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 17:38:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:38:10,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:10,234 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 17:38:10,234 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-02-04 17:38:10,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:10,234 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:10,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:10,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:10,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:10,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:10,254 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:10,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:10,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:10,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:10,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:10,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:10,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 17:38:10,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:10,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:10,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:38:10,307 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc6.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc6.base| 0)))) is different from true [2018-02-04 17:38:10,309 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 17:38:10,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:10,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:38:10,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:38:10,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:38:10,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:38:10,310 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-02-04 17:38:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:10,355 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-02-04 17:38:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:38:10,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 17:38:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:10,355 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:38:10,355 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:38:10,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:38:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:38:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 17:38:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:38:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 17:38:10,357 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-02-04 17:38:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:10,357 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 17:38:10,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:38:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 17:38:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:38:10,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:10,358 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 17:38:10,358 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-02-04 17:38:10,359 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:10,359 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:10,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:10,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:10,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:10,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:10,560 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 17:38:10,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:10,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:10,561 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:10,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:10,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:10,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:10,580 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 17:38:10,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:10,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:10,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:10,592 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 17:38:10,593 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 17:38:10,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:10,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:10,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:10,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:38:10,664 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 17:38:10,672 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 17:38:10,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:10,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:10,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:10,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:38:10,729 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 17:38:10,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:10,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 17:38:10,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:38:10,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:38:10,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:38:10,730 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 18 states. [2018-02-04 17:38:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:11,006 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-02-04 17:38:11,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:38:11,006 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-04 17:38:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:11,007 INFO L225 Difference]: With dead ends: 86 [2018-02-04 17:38:11,007 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 17:38:11,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:38:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 17:38:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 46. [2018-02-04 17:38:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:38:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-04 17:38:11,011 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 27 [2018-02-04 17:38:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:11,012 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-04 17:38:11,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:38:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-04 17:38:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:38:11,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:11,013 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:11,013 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:38:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 70029339, now seen corresponding path program 3 times [2018-02-04 17:38:11,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:11,014 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:11,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:11,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:11,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:11,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 17:38:11,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:11,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:11,142 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:38:11,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:38:11,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:11,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:11,178 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 17:38:11,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:11,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:11,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:11,200 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 17:38:11,201 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 17:38:11,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:11,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:11,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:11,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:38:11,240 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 17:38:11,245 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 17:38:11,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:11,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:11,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:11,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:38:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 17:38:11,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:11,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-02-04 17:38:11,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:38:11,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:38:11,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:38:11,280 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-02-04 17:38:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:11,424 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 17:38:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:38:11,424 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-04 17:38:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:11,424 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:38:11,424 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:38:11,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:38:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:38:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:38:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:38:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:38:11,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-04 17:38:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:11,425 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:38:11,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:38:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:38:11,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:38:11,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:38:11 BoogieIcfgContainer [2018-02-04 17:38:11,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:38:11,429 INFO L168 Benchmark]: Toolchain (without parser) took 3408.41 ms. Allocated memory was 404.2 MB in the beginning and 683.7 MB in the end (delta: 279.4 MB). Free memory was 362.4 MB in the beginning and 630.1 MB in the end (delta: -267.7 MB). Peak memory consumption was 11.8 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:11,430 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:38:11,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.03 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 351.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:11,430 INFO L168 Benchmark]: Boogie Preprocessor took 23.37 ms. Allocated memory is still 404.2 MB. Free memory was 351.8 MB in the beginning and 349.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:11,430 INFO L168 Benchmark]: RCFGBuilder took 158.39 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 332.5 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:11,431 INFO L168 Benchmark]: TraceAbstraction took 3078.87 ms. Allocated memory was 404.2 MB in the beginning and 683.7 MB in the end (delta: 279.4 MB). Free memory was 332.5 MB in the beginning and 630.1 MB in the end (delta: -297.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:38:11,431 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 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.03 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 351.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.37 ms. Allocated memory is still 404.2 MB. Free memory was 351.8 MB in the beginning and 349.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 158.39 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 332.5 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3078.87 ms. Allocated memory was 404.2 MB in the beginning and 683.7 MB in the end (delta: 279.4 MB). Free memory was 332.5 MB in the beginning and 630.1 MB in the end (delta: -297.6 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: 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, 3.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 236 SDtfs, 520 SDslu, 854 SDs, 0 SdLazy, 743 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 81 SyntacticMatches, 13 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.4s 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, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 244 ConstructedInterpolants, 12 QuantifiedInterpolants, 53766 SizeOfPredicates, 27 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 18/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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-38-11-436.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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-38-11-436.csv Received shutdown request...