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_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:50:07,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:50:07,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:50:07,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:50:07,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:50:07,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:50:07,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:50:07,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:50:07,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:50:07,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:50:07,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:50:07,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:50:07,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:50:07,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:50:07,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:50:07,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:50:07,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:50:07,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:50:07,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:50:07,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:50:07,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:50:07,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:50:07,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:50:07,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:50:07,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:50:07,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:50:07,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:50:07,858 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:50:07,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:50:07,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:50:07,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:50:07,859 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_Array.epf [2018-02-02 19:50:07,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:50:07,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:50:07,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:50:07,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:50:07,870 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:50:07,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:50:07,870 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:50:07,870 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:50:07,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:50:07,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:50:07,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:50:07,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:50:07,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:50:07,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:50:07,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:50:07,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:50:07,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:50:07,907 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:50:07,910 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:50:07,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:50:07,911 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:50:07,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:50:08,023 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:50:08,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:50:08,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:50:08,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:50:08,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:50:08,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1482aa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08, skipping insertion in model container [2018-02-02 19:50:08,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,040 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:50:08,066 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:50:08,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:50:08,167 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:50:08,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08 WrapperNode [2018-02-02 19:50:08,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:50:08,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:50:08,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:50:08,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:50:08,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (1/1) ... [2018-02-02 19:50:08,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:50:08,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:50:08,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:50:08,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:50:08,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50: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-02 19:50:08,234 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:50:08,234 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:50:08,234 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:50:08,234 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:50:08,235 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:50:08,236 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:50:08,389 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:50:08,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:50:08 BoogieIcfgContainer [2018-02-02 19:50:08,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:50:08,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:50:08,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:50:08,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:50:08,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:50:08" (1/3) ... [2018-02-02 19:50:08,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8145b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:50:08, skipping insertion in model container [2018-02-02 19:50:08,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:50:08" (2/3) ... [2018-02-02 19:50:08,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8145b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:50:08, skipping insertion in model container [2018-02-02 19:50:08,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:50:08" (3/3) ... [2018-02-02 19:50:08,394 INFO L107 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:50:08,399 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:50:08,404 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 19:50:08,426 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:50:08,426 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:50:08,426 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:50:08,427 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:50:08,427 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:50:08,427 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:50:08,427 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:50:08,427 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:50:08,427 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:50:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-02-02 19:50:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:50:08,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:08,443 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:08,443 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-02-02 19:50:08,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:08,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:08,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:50:08,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:50:08,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:08,572 INFO L182 omatonBuilderFactory]: Interpolants [48#false, 49#(not (= 0 |main_#t~malloc1.base|)), 50#(not (= 0 main_~arr~0.base)), 47#true] [2018-02-02 19:50:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:08,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:50:08,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:50:08,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:50:08,583 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-02-02 19:50:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:08,693 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-02 19:50:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:50:08,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:50:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:08,746 INFO L225 Difference]: With dead ends: 42 [2018-02-02 19:50:08,746 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 19:50:08,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:50:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 19:50:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 19:50:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 19:50:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-02 19:50:08,772 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-02-02 19:50:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:08,772 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-02 19:50:08,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:50:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-02 19:50:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:50:08,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:08,773 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:08,773 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-02-02 19:50:08,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:08,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:08,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:50:08,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:50:08,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:08,818 INFO L182 omatonBuilderFactory]: Interpolants [134#true, 135#false, 136#(= 1 (select |#valid| |main_#t~malloc1.base|)), 137#(= 1 (select |#valid| main_~arr~0.base))] [2018-02-02 19:50:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:08,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:50:08,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:50:08,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:50:08,821 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-02-02 19:50:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:08,898 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-02-02 19:50:08,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:50:08,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 19:50:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:08,900 INFO L225 Difference]: With dead ends: 35 [2018-02-02 19:50:08,900 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 19:50:08,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:50:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 19:50:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 19:50:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 19:50:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-02-02 19:50:08,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-02-02 19:50:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:08,905 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-02-02 19:50:08,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:50:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-02-02 19:50:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:50:08,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:08,906 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:08,906 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-02-02 19:50:08,908 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:08,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:50:09,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:50:09,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,038 INFO L182 omatonBuilderFactory]: Interpolants [210#true, 211#false, 212#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 213#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 214#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (= main_~i~0 0)), 215#(and (<= (+ (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0) (= main_~i~0 0))] [2018-02-02 19:50:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:50:09,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:50:09,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:50:09,038 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-02-02 19:50:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:09,203 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-02 19:50:09,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:50:09,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 19:50:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:09,204 INFO L225 Difference]: With dead ends: 69 [2018-02-02 19:50:09,204 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 19:50:09,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:50:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 19:50:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-02-02 19:50:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 19:50:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-02-02 19:50:09,209 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2018-02-02 19:50:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:09,210 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-02-02 19:50:09,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:50:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-02-02 19:50:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:50:09,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:09,211 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:09,211 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1688741209, now seen corresponding path program 1 times [2018-02-02 19:50:09,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:09,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:50:09,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:50:09,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,242 INFO L182 omatonBuilderFactory]: Interpolants [332#true, 333#false, 334#(<= 1 main_~length~0), 335#(and (<= 1 main_~length~0) (= main_~i~0 0))] [2018-02-02 19:50:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:50:09,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:50:09,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:50:09,243 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 4 states. [2018-02-02 19:50:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:09,257 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-02 19:50:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:50:09,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 19:50:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:09,258 INFO L225 Difference]: With dead ends: 40 [2018-02-02 19:50:09,258 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 19:50:09,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:50:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 19:50:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 19:50:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 19:50:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-02-02 19:50:09,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2018-02-02 19:50:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:09,261 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-02-02 19:50:09,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:50:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-02-02 19:50:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:50:09,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:09,262 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:09,262 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-02-02 19:50:09,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:09,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:50:09,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 19:50:09,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,298 INFO L182 omatonBuilderFactory]: Interpolants [416#false, 417#(<= main_~length~0 1), 418#(and (<= main_~length~0 1) (= main_~i~0 0)), 419#(<= main_~length~0 main_~i~0), 415#true] [2018-02-02 19:50:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:50:09,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:50:09,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:50:09,299 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-02-02 19:50:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:09,326 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-02-02 19:50:09,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:50:09,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 19:50:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:09,327 INFO L225 Difference]: With dead ends: 68 [2018-02-02 19:50:09,327 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 19:50:09,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:50:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 19:50:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-02-02 19:50:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 19:50:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 19:50:09,332 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-02-02 19:50:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:09,332 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 19:50:09,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:50:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 19:50:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:50:09,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:09,333 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:09,333 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-02-02 19:50:09,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:09,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:50:09,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 19:50:09,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,436 INFO L182 omatonBuilderFactory]: Interpolants [544#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= 4 (+ main_~arr~0.offset (* 4 main_~i~0))) (= main_~arr~0.offset 0)), 545#(and (<= 4 (+ main_~arr~0.offset (* 4 main_~i~0))) (<= (+ (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 539#true, 540#false, 541#(and (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 542#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0)), 543#(and (<= 0 (+ main_~arr~0.offset (* 4 main_~i~0))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~arr~0.offset 0))] [2018-02-02 19:50:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:50:09,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:50:09,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:50:09,437 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 7 states. [2018-02-02 19:50:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:09,520 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-02 19:50:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:50:09,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 19:50:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:09,521 INFO L225 Difference]: With dead ends: 49 [2018-02-02 19:50:09,521 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 19:50:09,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:50:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 19:50:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-02 19:50:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 19:50:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-02 19:50:09,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-02-02 19:50:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:09,523 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-02 19:50:09,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:50:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-02 19:50:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:50:09,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:09,524 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:09,524 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-02-02 19:50:09,525 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:09,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:50:09,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 19:50:09,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,615 INFO L182 omatonBuilderFactory]: Interpolants [656#(and (= main_~arr~0.offset 0) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base))), 657#(and (= main_~j~0 0) (= main_~arr~0.offset 0) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base))), 649#true, 650#false, 651#(<= 1 main_~length~0), 652#(and (= 0 |main_#t~malloc1.offset|) (<= 1 main_~length~0)), 653#(and (= main_~arr~0.offset 0) (<= 1 main_~length~0)), 654#(and (<= (+ main_~arr~0.offset (* 4 main_~i~0) 8) (+ (select |#length| main_~arr~0.base) (* 4 main_~length~0))) (= main_~arr~0.offset 0)), 655#(and (<= (+ main_~arr~0.offset (* 4 main_~i~0) 4) (+ (select |#length| main_~arr~0.base) (* 4 main_~length~0))) (= main_~arr~0.offset 0))] [2018-02-02 19:50:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:50:09,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:50:09,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:50:09,616 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 9 states. [2018-02-02 19:50:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:09,731 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-02 19:50:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:50:09,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 19:50:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:09,732 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:50:09,732 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:50:09,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:50:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:50:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-02-02 19:50:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 19:50:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-02 19:50:09,736 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-02-02 19:50:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:09,736 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-02 19:50:09,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:50:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-02 19:50:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:50:09,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:09,737 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:09,737 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:09,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-02-02 19:50:09,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:09,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:50:09,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 19:50:09,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,897 INFO L182 omatonBuilderFactory]: Interpolants [784#(and (<= main_~length~0 1) (= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|))), 785#(and (<= main_~length~0 1) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 786#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= (+ main_~arr~0.offset (* 4 main_~i~0) (* 4 main_~length~0)) (select |#length| main_~arr~0.base))), 787#(and (<= (+ main_~arr~0.offset (* 4 main_~i~0) (* 4 main_~length~0)) (+ (select |#length| main_~arr~0.base) 4)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 788#(and (<= (+ main_~arr~0.offset (* 8 main_~length~0)) (+ (select |#length| main_~arr~0.base) 4)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 789#(and (<= (* 8 main_~length~0) (+ (* 4 main_~j~0) (select |#length| main_~arr~0.base) 4)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 790#(and (<= (* 8 main_~length~0) (+ (* 4 main_~j~0) (select |#length| main_~arr~0.base))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 781#true, 782#false, 783#(<= main_~length~0 1)] [2018-02-02 19:50:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:09,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:50:09,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:50:09,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:50:09,898 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 10 states. [2018-02-02 19:50:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:10,077 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-02 19:50:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:50:10,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-02 19:50:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:10,078 INFO L225 Difference]: With dead ends: 73 [2018-02-02 19:50:10,078 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 19:50:10,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:50:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 19:50:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-02 19:50:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 19:50:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 19:50:10,081 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-02-02 19:50:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:10,082 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 19:50:10,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:50:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 19:50:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:50:10,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:10,082 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:10,082 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-02-02 19:50:10,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:10,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:10,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:50:10,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 19:50:10,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:10,221 INFO L182 omatonBuilderFactory]: Interpolants [946#true, 947#false, 948#(= (* 4 main_~length~0) (select |#length| |main_#t~malloc1.base|)), 949#(= (* 4 main_~length~0) (select |#length| main_~arr~0.base)), 950#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (= main_~i~0 0)), 951#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= (+ main_~arr~0.offset (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= main_~i~0 0)), 952#(and (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)) (<= (+ main_~arr~0.offset (* 8 main_~i~0)) (+ (select |#length| main_~arr~0.base) 4))), 953#(and (<= (+ main_~arr~0.offset (* 8 main_~length~0)) (+ (select |#length| main_~arr~0.base) 4)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 954#(and (<= (* 8 main_~length~0) (+ (* 4 main_~j~0) (select |#length| main_~arr~0.base) 4)) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base))), 955#(and (<= (* 8 main_~length~0) (+ (* 4 main_~j~0) (select |#length| main_~arr~0.base))) (= (* 4 main_~length~0) (select |#length| main_~arr~0.base)))] [2018-02-02 19:50:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:10,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:50:10,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:50:10,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:50:10,222 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 10 states. [2018-02-02 19:50:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:10,334 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-02-02 19:50:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:50:10,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-02 19:50:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:10,335 INFO L225 Difference]: With dead ends: 98 [2018-02-02 19:50:10,335 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 19:50:10,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:50:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 19:50:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2018-02-02 19:50:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 19:50:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-02-02 19:50:10,338 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-02-02 19:50:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:10,338 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-02-02 19:50:10,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:50:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-02-02 19:50:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:50:10,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:10,339 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:10,339 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-02-02 19:50:10,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:10,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:50:10,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:50:10,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:50:10,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:10,392 INFO L182 omatonBuilderFactory]: Interpolants [1145#true, 1146#false, 1147#(= |#valid| |old(#valid)|), 1148#(= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))] [2018-02-02 19:50:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:50:10,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:50:10,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:50:10,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:50:10,392 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2018-02-02 19:50:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:10,413 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-02-02 19:50:10,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:50:10,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 19:50:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:10,414 INFO L225 Difference]: With dead ends: 72 [2018-02-02 19:50:10,414 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 19:50:10,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:50:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 19:50:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 19:50:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 19:50:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-02-02 19:50:10,417 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2018-02-02 19:50:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:10,418 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-02-02 19:50:10,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:50:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-02-02 19:50:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:50:10,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:50:10,419 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:50:10,419 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 19:50:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 262979632, now seen corresponding path program 2 times [2018-02-02 19:50:10,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:50:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:50:10,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:50:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:50:10,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:50:10,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 19:50:10,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:50:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:50:10,477 INFO L182 omatonBuilderFactory]: Interpolants [1268#true, 1269#false, 1270#(<= (+ main_~arr~0.offset (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)), 1271#(<= (+ main_~arr~0.offset (* 4 main_~i~0)) (select |#length| main_~arr~0.base)), 1272#(<= (+ main_~arr~0.offset (* 4 main_~length~0)) (select |#length| main_~arr~0.base)), 1273#(and (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (select |#length| main_~arr~0.base)) (<= 0 (+ main_~arr~0.offset (* 4 main_~j~0)))), 1274#(and (<= 4 (+ main_~arr~0.offset (* 4 main_~j~0))) (<= (+ main_~arr~0.offset (* 4 main_~length~0)) (select |#length| main_~arr~0.base))), 1275#(and (<= 4 (+ main_~arr~0.offset (* 4 main_~j~0))) (<= (+ main_~arr~0.offset (* 4 main_~j~0) 4) (select |#length| main_~arr~0.base)))] [2018-02-02 19:50:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:50:10,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:50:10,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:50:10,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:50:10,478 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2018-02-02 19:50:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:50:10,548 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-02 19:50:10,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:50:10,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 19:50:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:50:10,549 INFO L225 Difference]: With dead ends: 45 [2018-02-02 19:50:10,549 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 19:50:10,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:50:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 19:50:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 19:50:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 19:50:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 19:50:10,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-02 19:50:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:50:10,550 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 19:50:10,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:50:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 19:50:10,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 19:50:10,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:50:10 BoogieIcfgContainer [2018-02-02 19:50:10,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:50:10,556 INFO L168 Benchmark]: Toolchain (without parser) took 2533.12 ms. Allocated memory was 402.1 MB in the beginning and 628.6 MB in the end (delta: 226.5 MB). Free memory was 360.3 MB in the beginning and 426.7 MB in the end (delta: -66.4 MB). Peak memory consumption was 160.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:50:10,557 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:50:10,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.21 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 349.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:50:10,558 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 ms. Allocated memory is still 402.1 MB. Free memory was 349.8 MB in the beginning and 347.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:50:10,558 INFO L168 Benchmark]: RCFGBuilder took 193.55 ms. Allocated memory is still 402.1 MB. Free memory was 347.1 MB in the beginning and 329.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:50:10,558 INFO L168 Benchmark]: TraceAbstraction took 2165.78 ms. Allocated memory was 402.1 MB in the beginning and 628.6 MB in the end (delta: 226.5 MB). Free memory was 329.1 MB in the beginning and 426.7 MB in the end (delta: -97.6 MB). Peak memory consumption was 128.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:50:10,559 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.10 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.21 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 349.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 22.13 ms. Allocated memory is still 402.1 MB. Free memory was 349.8 MB in the beginning and 347.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.55 ms. Allocated memory is still 402.1 MB. Free memory was 347.1 MB in the beginning and 329.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2165.78 ms. Allocated memory was 402.1 MB in the beginning and 628.6 MB in the end (delta: 226.5 MB). Free memory was 329.1 MB in the beginning and 426.7 MB in the end (delta: -97.6 MB). Peak memory consumption was 128.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 9 error locations. SAFE Result, 2.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 316 SDtfs, 929 SDslu, 606 SDs, 0 SdLazy, 591 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 23/39 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, 11 MinimizatonAttempts, 86 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 36882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 23/39 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/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-50-10-566.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-50-10-566.csv Received shutdown request...