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/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:55:06,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:55:06,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:55:06,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:55:06,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:55:06,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:55:06,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:55:06,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:55:06,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:55:06,874 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:55:06,875 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:55:06,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:55:06,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:55:06,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:55:06,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:55:06,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:55:06,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:55:06,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:55:06,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:55:06,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:55:06,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:55:06,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:55:06,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:55:06,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:55:06,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:55:06,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:55:06,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:55:06,889 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:55:06,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:55:06,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:55:06,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:55:06,890 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-04 14:55:06,899 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:55:06,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:55:06,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:55:06,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:55:06,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:55:06,901 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:55:06,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:55:06,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:55:06,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:55:06,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:55:06,938 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:55:06,941 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:55:06,942 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:55:06,942 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:55:06,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-02-04 14:55:07,060 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:55:07,061 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:55:07,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:55:07,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:55:07,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:55:07,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac502e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07, skipping insertion in model container [2018-02-04 14:55:07,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,079 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:55:07,106 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:55:07,192 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:55:07,206 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:55:07,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07 WrapperNode [2018-02-04 14:55:07,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:55:07,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:55:07,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:55:07,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:55:07,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (1/1) ... [2018-02-04 14:55:07,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:55:07,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:55:07,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:55:07,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:55:07,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (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 14:55:07,274 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:55:07,275 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:55:07,275 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-04 14:55:07,275 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:55:07,275 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:55:07,275 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:55:07,275 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-04 14:55:07,276 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:55:07,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:55:07,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:55:07,514 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:55:07,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:55:07 BoogieIcfgContainer [2018-02-04 14:55:07,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:55:07,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:55:07,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:55:07,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:55:07,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:55:07" (1/3) ... [2018-02-04 14:55:07,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c2ddf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:55:07, skipping insertion in model container [2018-02-04 14:55:07,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:55:07" (2/3) ... [2018-02-04 14:55:07,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c2ddf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:55:07, skipping insertion in model container [2018-02-04 14:55:07,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:55:07" (3/3) ... [2018-02-04 14:55:07,520 INFO L107 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-02-04 14:55:07,525 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:55:07,532 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-02-04 14:55:07,564 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:55:07,564 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:55:07,564 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:55:07,564 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:55:07,564 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:55:07,565 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:55:07,565 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:55:07,565 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:55:07,566 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:55:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-02-04 14:55:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:55:07,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:07,587 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:55:07,588 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -40654889, now seen corresponding path program 1 times [2018-02-04 14:55:07,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:07,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:07,752 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 14:55:07,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:07,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:55:07,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:07,756 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 14:55:07,756 INFO L182 omatonBuilderFactory]: Interpolants [84#true, 85#false, 86#(= 1 (select |#valid| |lis_#t~malloc0.base|)), 87#(= 1 (select |#valid| lis_~best~0.base))] [2018-02-04 14:55:07,757 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 14:55:07,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:55:07,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:55:07,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:55:07,772 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-02-04 14:55:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:07,931 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 14:55:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:55:07,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 14:55:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:07,938 INFO L225 Difference]: With dead ends: 73 [2018-02-04 14:55:07,938 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 14:55:07,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:55:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 14:55:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 14:55:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 14:55:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 14:55:07,963 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2018-02-04 14:55:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:07,964 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 14:55:07,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:55:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 14:55:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:55:07,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:07,964 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:55:07,964 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash -40654888, now seen corresponding path program 1 times [2018-02-04 14:55:07,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:07,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:08,070 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 14:55:08,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:08,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:55:08,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:08,071 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 14:55:08,072 INFO L182 omatonBuilderFactory]: Interpolants [233#true, 234#false, 235#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= (* 4 lis_~N) (select |#length| |lis_#t~malloc0.base|)) (= 0 |lis_#t~malloc0.offset|)), 236#(and (= (select |#valid| lis_~best~0.base) 1) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 237#(and (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 238#(and (= lis_~i~0 0) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 239#(and (= lis_~i~0 0) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0))] [2018-02-04 14:55:08,072 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 14:55:08,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:55:08,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:55:08,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:55:08,074 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2018-02-04 14:55:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:08,271 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-02-04 14:55:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:55:08,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 14:55:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:08,275 INFO L225 Difference]: With dead ends: 91 [2018-02-04 14:55:08,275 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 14:55:08,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:55:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 14:55:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-02-04 14:55:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 14:55:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-02-04 14:55:08,282 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2018-02-04 14:55:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:08,282 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-02-04 14:55:08,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:55:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-02-04 14:55:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 14:55:08,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:08,283 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:55:08,283 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301570, now seen corresponding path program 1 times [2018-02-04 14:55:08,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:08,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:08,319 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 14:55:08,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:08,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:55:08,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:08,320 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 14:55:08,320 INFO L182 omatonBuilderFactory]: Interpolants [416#(= 1 (select |#valid| |lis_#t~malloc1.base|)), 417#(= 1 (select |#valid| lis_~prev~0.base)), 414#true, 415#false] [2018-02-04 14:55:08,320 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 14:55:08,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:55:08,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:55:08,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:55:08,321 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-02-04 14:55:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:08,367 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-02-04 14:55:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:55:08,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 14:55:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:08,370 INFO L225 Difference]: With dead ends: 75 [2018-02-04 14:55:08,371 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 14:55:08,371 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 14:55:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 14:55:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 14:55:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 14:55:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-02-04 14:55:08,374 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2018-02-04 14:55:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:08,375 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-02-04 14:55:08,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:55:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-02-04 14:55:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 14:55:08,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:08,375 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:55:08,375 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301569, now seen corresponding path program 1 times [2018-02-04 14:55:08,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:08,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:08,475 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 14:55:08,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:08,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:55:08,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:08,476 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 14:55:08,476 INFO L182 omatonBuilderFactory]: Interpolants [576#(and (= lis_~prev~0.offset 0) (= lis_~best~0.offset 0) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~prev~0.base))), 577#(and (<= 0 lis_~i~0) (= lis_~prev~0.offset 0) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~prev~0.base))), 570#true, 571#false, 572#(= 0 |lis_#t~malloc0.offset|), 573#(= lis_~best~0.offset 0), 574#(and (= 0 |lis_#t~malloc1.offset|) (= (* 4 lis_~N) (select |#length| |lis_#t~malloc1.base|)) (= lis_~best~0.offset 0)), 575#(and (= lis_~prev~0.offset 0) (= lis_~best~0.offset 0) (= (* 4 lis_~N) (select |#length| lis_~prev~0.base)))] [2018-02-04 14:55:08,476 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 14:55:08,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:55:08,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:55:08,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:55:08,476 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 8 states. [2018-02-04 14:55:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:08,636 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-02-04 14:55:08,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:55:08,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 14:55:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:08,643 INFO L225 Difference]: With dead ends: 91 [2018-02-04 14:55:08,643 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 14:55:08,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:55:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 14:55:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-02-04 14:55:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 14:55:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 14:55:08,650 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2018-02-04 14:55:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:08,650 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 14:55:08,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:55:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 14:55:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:55:08,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:08,651 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] [2018-02-04 14:55:08,651 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1752664061, now seen corresponding path program 1 times [2018-02-04 14:55:08,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:08,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:08,683 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 14:55:08,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:08,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:55:08,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:08,684 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 14:55:08,684 INFO L182 omatonBuilderFactory]: Interpolants [752#false, 753#(= lis_~i~0 0), 754#(<= lis_~N 0), 755#(and (<= lis_~N 0) (= lis_~i~0 1)), 751#true] [2018-02-04 14:55:08,684 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 14:55:08,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:55:08,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:55:08,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:55:08,684 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 5 states. [2018-02-04 14:55:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:08,751 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-04 14:55:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:55:08,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:55:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:08,752 INFO L225 Difference]: With dead ends: 88 [2018-02-04 14:55:08,752 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 14:55:08,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:55:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 14:55:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-02-04 14:55:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 14:55:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-02-04 14:55:08,755 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 20 [2018-02-04 14:55:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:08,755 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-02-04 14:55:08,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:55:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-02-04 14:55:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:55:08,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:08,756 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:55:08,756 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -304076685, now seen corresponding path program 1 times [2018-02-04 14:55:08,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:08,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:55:08,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:55:08,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 14:55:08,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:08,859 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 14:55:08,859 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 929#(and (<= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 930#(and (<= 4 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 931#(and (<= 4 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 924#true, 925#false, 926#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= (* 4 lis_~N) (select |#length| |lis_#t~malloc0.base|)) (= 0 |lis_#t~malloc0.offset|)), 927#(and (= (select |#valid| lis_~best~0.base) 1) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0))] [2018-02-04 14:55:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:55:08,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:55:08,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:55:08,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:55:08,860 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 8 states. [2018-02-04 14:55:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:09,018 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 14:55:09,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:55:09,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 14:55:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:09,019 INFO L225 Difference]: With dead ends: 83 [2018-02-04 14:55:09,019 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 14:55:09,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:55:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 14:55:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-02-04 14:55:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 14:55:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-04 14:55:09,022 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 20 [2018-02-04 14:55:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:09,022 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-04 14:55:09,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:55:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-04 14:55:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:55:09,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:09,023 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] [2018-02-04 14:55:09,023 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash -692554244, now seen corresponding path program 1 times [2018-02-04 14:55:09,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:09,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:09,101 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 14:55:09,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:09,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:55:09,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:09,102 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 14:55:09,103 INFO L182 omatonBuilderFactory]: Interpolants [1090#true, 1091#false, 1092#(and (not (= |lis_#t~malloc0.base| 0)) (= 1 (select |#valid| |lis_#t~malloc0.base|))), 1093#(and (= 1 (select |#valid| lis_~best~0.base)) (not (= lis_~best~0.base 0))), 1094#(and (not (= lis_~best~0.base 0)) (= 1 (select (store |#valid| lis_~best~0.base 0) |lis_#t~malloc1.base|))), 1095#(and (= 1 (select (store |#valid| lis_~best~0.base 0) lis_~prev~0.base)) (not (= lis_~best~0.base 0))), 1096#(= 1 (select |#valid| lis_~prev~0.base))] [2018-02-04 14:55:09,103 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 14:55:09,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:55:09,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:55:09,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:55:09,104 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 7 states. [2018-02-04 14:55:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:09,177 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-04 14:55:09,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:55:09,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 14:55:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:09,177 INFO L225 Difference]: With dead ends: 66 [2018-02-04 14:55:09,177 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 14:55:09,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:55:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 14:55:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 14:55:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 14:55:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-04 14:55:09,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 22 [2018-02-04 14:55:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:09,180 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-04 14:55:09,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:55:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-04 14:55:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:55:09,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:09,181 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, 1, 1, 1] [2018-02-04 14:55:09,181 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1804279880, now seen corresponding path program 1 times [2018-02-04 14:55:09,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:09,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:09,222 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 14:55:09,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:55:09,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 14:55:09,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:09,222 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 14:55:09,222 INFO L182 omatonBuilderFactory]: Interpolants [1237#true, 1238#false, 1239#(= lis_~i~0 0), 1240#(<= lis_~i~0 1), 1241#(<= lis_~N 1), 1242#(and (= lis_~i~0 1) (<= lis_~N 1))] [2018-02-04 14:55:09,223 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 14:55:09,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:55:09,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:55:09,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:55:09,223 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2018-02-04 14:55:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:09,300 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-02-04 14:55:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:55:09,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 14:55:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:09,301 INFO L225 Difference]: With dead ends: 141 [2018-02-04 14:55:09,301 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 14:55:09,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:55:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 14:55:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2018-02-04 14:55:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 14:55:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-02-04 14:55:09,306 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25 [2018-02-04 14:55:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:09,307 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-02-04 14:55:09,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:55:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-02-04 14:55:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 14:55:09,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:09,308 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, 1, 1, 1, 1] [2018-02-04 14:55:09,309 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash -186387055, now seen corresponding path program 1 times [2018-02-04 14:55:09,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:55:09,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:55:09,489 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 14:55:09,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:55:09,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:55:09,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:55:09,490 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 14:55:09,490 INFO L182 omatonBuilderFactory]: Interpolants [1472#true, 1473#false, 1474#(= |#valid| |old(#valid)|), 1475#(and (= 0 (select |old(#valid)| |lis_#t~malloc0.base|)) (not (= |lis_#t~malloc0.base| 0)) (= (store |#valid| |lis_#t~malloc0.base| (select |old(#valid)| |lis_#t~malloc0.base|)) |old(#valid)|)), 1476#(and (not (= lis_~best~0.base 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (or (= |#valid| |old(#valid)|) (= lis_~best~0.base (@diff |#valid| |old(#valid)|))) (= 0 (select |old(#valid)| lis_~best~0.base))), 1477#(and (not (= 0 |lis_#t~malloc1.base|)) (or (= lis_~best~0.base |lis_#t~malloc1.base|) (and (= (store (store |#valid| |lis_#t~malloc1.base| (select |old(#valid)| |lis_#t~malloc1.base|)) lis_~best~0.base (select |old(#valid)| lis_~best~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| |lis_#t~malloc1.base|)) (= (select (store |#valid| lis_~best~0.base 0) lis_~best~0.base) (select |old(#valid)| lis_~best~0.base)))) (not (= lis_~best~0.base 0))), 1478#(and (not (= 0 lis_~prev~0.base)) (not (= lis_~best~0.base 0)) (or (and (= (store (store |#valid| lis_~best~0.base (select |old(#valid)| lis_~best~0.base)) lis_~prev~0.base (select |old(#valid)| lis_~prev~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| lis_~prev~0.base)) (= (select (store |#valid| lis_~best~0.base 0) lis_~best~0.base) (select |old(#valid)| lis_~best~0.base))) (= lis_~best~0.base lis_~prev~0.base))), 1479#(and (not (= 0 lis_~prev~0.base)) (or (= 0 (select |#valid| lis_~prev~0.base)) (and (= (select (store |#valid| lis_~prev~0.base 0) lis_~prev~0.base) (select |old(#valid)| lis_~prev~0.base)) (= (store |#valid| lis_~prev~0.base (select |old(#valid)| lis_~prev~0.base)) |old(#valid)|))))] [2018-02-04 14:55:09,490 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 14:55:09,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:55:09,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:55:09,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:55:09,490 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 8 states. [2018-02-04 14:55:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:55:09,661 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-02-04 14:55:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:55:09,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 14:55:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:55:09,662 INFO L225 Difference]: With dead ends: 83 [2018-02-04 14:55:09,662 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 14:55:09,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:55:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 14:55:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 14:55:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:55:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 14:55:09,664 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-02-04 14:55:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:55:09,664 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 14:55:09,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:55:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 14:55:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:55:09,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:55:09,665 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:55:09,665 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:55:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash -324019421, now seen corresponding path program 2 times [2018-02-04 14:55:09,665 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:55:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 14:55:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 14:55:09,706 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 14:55:09,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:55:09 BoogieIcfgContainer [2018-02-04 14:55:09,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:55:09,731 INFO L168 Benchmark]: Toolchain (without parser) took 2670.15 ms. Allocated memory was 393.7 MB in the beginning and 621.8 MB in the end (delta: 228.1 MB). Free memory was 350.6 MB in the beginning and 392.8 MB in the end (delta: -42.2 MB). Peak memory consumption was 185.9 MB. Max. memory is 5.3 GB. [2018-02-04 14:55:09,732 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 393.7 MB. Free memory is still 357.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:55:09,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.78 ms. Allocated memory is still 393.7 MB. Free memory was 350.6 MB in the beginning and 340.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:55:09,732 INFO L168 Benchmark]: Boogie Preprocessor took 22.39 ms. Allocated memory is still 393.7 MB. Free memory was 340.1 MB in the beginning and 338.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:55:09,732 INFO L168 Benchmark]: RCFGBuilder took 279.56 ms. Allocated memory is still 393.7 MB. Free memory was 338.7 MB in the beginning and 312.8 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-04 14:55:09,732 INFO L168 Benchmark]: TraceAbstraction took 2214.77 ms. Allocated memory was 393.7 MB in the beginning and 621.8 MB in the end (delta: 228.1 MB). Free memory was 312.8 MB in the beginning and 392.8 MB in the end (delta: -80.0 MB). Peak memory consumption was 148.1 MB. Max. memory is 5.3 GB. [2018-02-04 14:55:09,733 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.11 ms. Allocated memory is still 393.7 MB. Free memory is still 357.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.78 ms. Allocated memory is still 393.7 MB. Free memory was 350.6 MB in the beginning and 340.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.39 ms. Allocated memory is still 393.7 MB. Free memory was 340.1 MB in the beginning and 338.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 279.56 ms. Allocated memory is still 393.7 MB. Free memory was 338.7 MB in the beginning and 312.8 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2214.77 ms. Allocated memory was 393.7 MB in the beginning and 621.8 MB in the end (delta: 228.1 MB). Free memory was 312.8 MB in the beginning and 392.8 MB in the end (delta: -80.0 MB). Peak memory consumption was 148.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) VAL [\old(N)=2, a={10:-5}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=2, a={10:-5}, a={10:-5}, max=0, N=2] [L543] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L543] best = (int*) malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L544] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=2, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=2, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L547] i = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] [L547] COND TRUE i < N [L548] j = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L548] COND TRUE j < i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L549] FCALL a[i] VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={13:0}, max=0, N=2, prev={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 27 error locations. UNSAFE Result, 2.1s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 429 SDtfs, 1298 SDslu, 677 SDs, 0 SdLazy, 755 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2/5 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, 118 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 26205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 2/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-55-09-738.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-55-09-738.csv Received shutdown request...