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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:48:37,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:48:37,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:48:37,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:48:37,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:48:37,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:48:37,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:48:37,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:48:37,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:48:37,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:48:37,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:48:37,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:48:37,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:48:37,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:48:37,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:48:37,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:48:37,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:48:37,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:48:37,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:48:37,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:48:37,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:48:37,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:48:37,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:48:37,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:48:37,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:48:37,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:48:37,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:48:37,069 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:48:37,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:48:37,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:48:37,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:48:37,070 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:48:37,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:48:37,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:48:37,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:48:37,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:48:37,081 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:48:37,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:48:37,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:48:37,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:48:37,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:48:37,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:48:37,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:48:37,082 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:48:37,082 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:48:37,082 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:48:37,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:48:37,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:48:37,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:48:37,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:48:37,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:48:37,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:48:37,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:48:37,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:48:37,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:48:37,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:48:37,128 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:48:37,132 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:48:37,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:48:37,134 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:48:37,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:48:37,269 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:48:37,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:48:37,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:48:37,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:48:37,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:48:37,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bbc70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37, skipping insertion in model container [2018-02-02 09:48:37,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,294 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:48:37,327 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:48:37,423 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:48:37,437 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:48:37,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37 WrapperNode [2018-02-02 09:48:37,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:48:37,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:48:37,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:48:37,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:48:37,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (1/1) ... [2018-02-02 09:48:37,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:48:37,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:48:37,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:48:37,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:48:37,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (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 09:48:37,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:48:37,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:48:37,525 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-02 09:48:37,525 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:48:37,525 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:48:37,525 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:48:37,525 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:48:37,525 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:48:37,525 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:48:37,526 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:48:37,526 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-02 09:48:37,526 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:48:37,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:48:37,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:48:37,753 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:48:37,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:48:37 BoogieIcfgContainer [2018-02-02 09:48:37,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:48:37,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:48:37,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:48:37,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:48:37,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:48:37" (1/3) ... [2018-02-02 09:48:37,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa2957b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:48:37, skipping insertion in model container [2018-02-02 09:48:37,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:37" (2/3) ... [2018-02-02 09:48:37,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa2957b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:48:37, skipping insertion in model container [2018-02-02 09:48:37,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:48:37" (3/3) ... [2018-02-02 09:48:37,758 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:48:37,763 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:48:37,768 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 09:48:37,801 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:48:37,802 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:48:37,802 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:48:37,802 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:48:37,802 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:48:37,802 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:48:37,803 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:48:37,803 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:48:37,803 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:48:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-02 09:48:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:48:37,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:37,825 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:37,826 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-02-02 09:48:37,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:37,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:38,029 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 09:48:38,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:38,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:48:38,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:38,033 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 09:48:38,034 INFO L182 omatonBuilderFactory]: Interpolants [87#true, 88#false, 89#(= 1 (select |#valid| |lis_#t~malloc0.base|)), 90#(= 1 (select |#valid| lis_~best~0.base))] [2018-02-02 09:48:38,034 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 09:48:38,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:48:38,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:48:38,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:48:38,115 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-02 09:48:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:38,203 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 09:48:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:48:38,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 09:48:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:38,210 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:48:38,211 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 09:48:38,212 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 09:48:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 09:48:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 09:48:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:48:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 09:48:38,236 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-02-02 09:48:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:38,236 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 09:48:38,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:48:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 09:48:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:48:38,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:38,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:38,237 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-02-02 09:48:38,238 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:38,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:38,349 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 09:48:38,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:38,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:48:38,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:38,350 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 09:48:38,350 INFO L182 omatonBuilderFactory]: Interpolants [244#true, 245#false, 246#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= (* 4 lis_~N) (select |#length| |lis_#t~malloc0.base|)) (= 0 |lis_#t~malloc0.offset|)), 247#(and (= (select |#valid| lis_~best~0.base) 1) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 248#(and (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 249#(and (= lis_~i~0 0) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 250#(and (= lis_~i~0 0) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0))] [2018-02-02 09:48:38,350 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 09:48:38,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:48:38,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:48:38,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:48:38,352 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-02 09:48:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:38,596 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-02 09:48:38,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:48:38,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 09:48:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:38,600 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:48:38,601 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:48:38,601 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-02 09:48:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:48:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-02-02 09:48:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:48:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 09:48:38,609 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-02-02 09:48:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:38,609 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 09:48:38,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:48:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 09:48:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:48:38,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:38,610 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:38,610 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-02-02 09:48:38,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:38,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:38,657 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 09:48:38,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:38,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:48:38,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:38,659 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 09:48:38,659 INFO L182 omatonBuilderFactory]: Interpolants [435#true, 436#false, 437#(= 1 (select |#valid| |lis_#t~malloc1.base|)), 438#(= 1 (select |#valid| lis_~prev~0.base))] [2018-02-02 09:48:38,659 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 09:48:38,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:48:38,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:48:38,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:48:38,660 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-02-02 09:48:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:38,700 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-02 09:48:38,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:48:38,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 09:48:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:38,702 INFO L225 Difference]: With dead ends: 80 [2018-02-02 09:48:38,702 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 09:48:38,702 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 09:48:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 09:48:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 09:48:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 09:48:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-02 09:48:38,708 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-02-02 09:48:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:38,708 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-02 09:48:38,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:48:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-02 09:48:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:48:38,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:38,709 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:38,709 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-02-02 09:48:38,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:38,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:38,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:38,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:48:38,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:38,801 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 09:48:38,801 INFO L182 omatonBuilderFactory]: Interpolants [608#(and (<= 0 lis_~i~0) (= lis_~prev~0.offset 0) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~prev~0.base))), 601#true, 602#false, 603#(= 0 |lis_#t~malloc0.offset|), 604#(= lis_~best~0.offset 0), 605#(and (= 0 |lis_#t~malloc1.offset|) (= (* 4 lis_~N) (select |#length| |lis_#t~malloc1.base|)) (= lis_~best~0.offset 0)), 606#(and (= lis_~prev~0.offset 0) (= lis_~best~0.offset 0) (= (* 4 lis_~N) (select |#length| lis_~prev~0.base))), 607#(and (= lis_~prev~0.offset 0) (= lis_~best~0.offset 0) (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~prev~0.base)))] [2018-02-02 09:48:38,801 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 09:48:38,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:48:38,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:48:38,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:38,802 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-02-02 09:48:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:39,017 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-02 09:48:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:48:39,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 09:48:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:39,019 INFO L225 Difference]: With dead ends: 97 [2018-02-02 09:48:39,019 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:48:39,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:48:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:48:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-02 09:48:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 09:48:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-02 09:48:39,024 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-02-02 09:48:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:39,025 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-02 09:48:39,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:48:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-02 09:48:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:48:39,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:39,026 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:39,026 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-02-02 09:48:39,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:39,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:39,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-02 09:48:39,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:39,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:48:39,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:39,104 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 09:48:39,104 INFO L182 omatonBuilderFactory]: Interpolants [800#(<= lis_~N 1), 801#(and (<= lis_~i~0 0) (= lis_~j~0 0)), 796#true, 797#false, 798#(<= main_~array_size~0 1), 799#(<= |lis_#in~N| 1)] [2018-02-02 09:48:39,104 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 09:48:39,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:39,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:39,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:39,105 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-02-02 09:48:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:39,196 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-02 09:48:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:48:39,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 09:48:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:39,197 INFO L225 Difference]: With dead ends: 128 [2018-02-02 09:48:39,197 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 09:48:39,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 09:48:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-02-02 09:48:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 09:48:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-02-02 09:48:39,206 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-02-02 09:48:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:39,207 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-02-02 09:48:39,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-02-02 09:48:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:48:39,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:39,208 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] [2018-02-02 09:48:39,208 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:39,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-02-02 09:48:39,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:39,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:39,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:39,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:48:39,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:39,292 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 09:48:39,293 INFO L182 omatonBuilderFactory]: Interpolants [1056#(<= main_~array_size~0 1), 1057#(<= |lis_#in~N| 1), 1058#(<= lis_~N 1), 1059#(and (<= lis_~N 1) (= 0 |lis_#t~malloc0.offset|)), 1060#(and (<= lis_~N 1) (= lis_~best~0.offset 0)), 1061#(and (<= (* 4 lis_~N) (+ (* 4 lis_~i~0) lis_~best~0.offset 4)) (= lis_~best~0.offset 0)), 1062#(and (<= (* 4 lis_~N) (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= lis_~best~0.offset 0)), 1054#true, 1055#false] [2018-02-02 09:48:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:39,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:48:39,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:48:39,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:48:39,294 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 9 states. [2018-02-02 09:48:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:39,412 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-02 09:48:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:48:39,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 09:48:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:39,413 INFO L225 Difference]: With dead ends: 118 [2018-02-02 09:48:39,413 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 09:48:39,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:48:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 09:48:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-02-02 09:48:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 09:48:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-02 09:48:39,419 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-02-02 09:48:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:39,419 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-02 09:48:39,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:48:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-02 09:48:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:48:39,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:39,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:39,420 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:39,420 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-02-02 09:48:39,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:39,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:39,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:39,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:48:39,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:39,474 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 09:48:39,474 INFO L182 omatonBuilderFactory]: Interpolants [1306#true, 1307#false, 1308#(<= 1 main_~array_size~0), 1309#(<= 1 |lis_#in~N|), 1310#(<= 1 lis_~N), 1311#(and (= lis_~i~0 0) (<= 1 lis_~N))] [2018-02-02 09:48:39,474 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 09:48:39,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:39,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:39,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:39,475 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-02-02 09:48:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:39,548 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-02-02 09:48:39,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:48:39,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 09:48:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:39,549 INFO L225 Difference]: With dead ends: 117 [2018-02-02 09:48:39,549 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 09:48:39,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 09:48:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-02 09:48:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 09:48:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-02 09:48:39,553 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-02-02 09:48:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:39,553 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-02 09:48:39,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-02 09:48:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:48:39,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:39,553 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] [2018-02-02 09:48:39,554 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-02-02 09:48:39,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:39,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:39,665 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-02 09:48:39,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:39,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:48:39,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:39,665 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 09:48:39,665 INFO L182 omatonBuilderFactory]: Interpolants [1552#(and (<= 4 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 1553#(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)), 1546#true, 1547#false, 1548#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= (* 4 lis_~N) (select |#length| |lis_#t~malloc0.base|)) (= 0 |lis_#t~malloc0.offset|)), 1549#(and (= (select |#valid| lis_~best~0.base) 1) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 1550#(and (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0)), 1551#(and (<= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= (* 4 lis_~N) (select |#length| lis_~best~0.base)) (= lis_~best~0.offset 0))] [2018-02-02 09:48:39,666 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-02 09:48:39,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:48:39,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:48:39,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:39,666 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 8 states. [2018-02-02 09:48:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:39,782 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-02 09:48:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:48:39,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 09:48:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:39,783 INFO L225 Difference]: With dead ends: 112 [2018-02-02 09:48:39,783 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:48:39,784 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-02 09:48:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:48:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-02-02 09:48:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 09:48:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-02-02 09:48:39,786 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-02-02 09:48:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:39,786 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-02-02 09:48:39,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:48:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-02-02 09:48:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:48:39,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:39,787 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, 1, 1, 1] [2018-02-02 09:48:39,787 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-02-02 09:48:39,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:39,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:39,830 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 09:48:39,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:39,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 09:48:39,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:39,830 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 09:48:39,831 INFO L182 omatonBuilderFactory]: Interpolants [1778#true, 1779#false, 1780#(= lis_~i~0 0), 1781#(<= lis_~i~0 1), 1782#(<= lis_~N 1), 1783#(and (<= lis_~i~0 0) (= lis_~j~0 0))] [2018-02-02 09:48:39,831 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 09:48:39,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:39,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:39,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:39,831 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 6 states. [2018-02-02 09:48:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:39,895 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-02-02 09:48:39,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:48:39,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 09:48:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:39,897 INFO L225 Difference]: With dead ends: 185 [2018-02-02 09:48:39,897 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 09:48:39,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:48:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 09:48:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 115. [2018-02-02 09:48:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 09:48:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-02-02 09:48:39,901 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 28 [2018-02-02 09:48:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:39,902 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-02-02 09:48:39,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-02-02 09:48:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:48:39,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:39,903 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, 1, 1, 1] [2018-02-02 09:48:39,903 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-02-02 09:48:39,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:39,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:40,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:40,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:40,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:40,190 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 09:48:40,190 INFO L182 omatonBuilderFactory]: Interpolants [2090#true, 2091#false, 2092#(and (= (select |#valid| |main_#t~malloc19.base|) 1) (= 0 |main_#t~malloc19.offset|) (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc19.base|))), 2093#(and (= (select |#valid| main_~numbers~0.base) 1) (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 2094#(and (= 0 |lis_#in~a.offset|) (= (select |#valid| |lis_#in~a.base|) 1) (<= (* 4 |lis_#in~N|) (select |#length| |lis_#in~a.base|))), 2095#(and (= lis_~a.offset 0) (<= (* 4 lis_~N) (select |#length| lis_~a.base)) (= (select |#valid| lis_~a.base) 1)), 2096#(and (= lis_~a.offset 0) (<= (* 4 lis_~N) (select |#length| lis_~a.base)) (= 0 |lis_#t~malloc0.offset|)), 2097#(and (= lis_~a.offset 0) (<= (* 4 lis_~N) (select |#length| lis_~a.base)) (= lis_~best~0.offset 0)), 2098#(and (<= (* 4 lis_~N) (+ (select |#length| lis_~a.base) (* 4 lis_~i~0) lis_~best~0.offset)) (= lis_~a.offset 0) (= lis_~best~0.offset 0)), 2099#(and (= lis_~a.offset 0) (<= (+ (* 4 lis_~N) 4) (+ (select |#length| lis_~a.base) (* 4 lis_~i~0) lis_~best~0.offset)) (= lis_~best~0.offset 0)), 2100#(and (= lis_~a.offset 0) (<= 8 (+ (select |#length| lis_~a.base) lis_~best~0.offset)) (= lis_~best~0.offset 0)), 2101#(and (<= 8 (select |#length| lis_~a.base)) (= lis_~a.offset 0)), 2102#(and (<= 8 (select |#length| lis_~a.base)) (= lis_~a.offset 0) (= lis_~i~0 1))] [2018-02-02 09:48:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:40,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:48:40,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:48:40,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:48:40,190 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 13 states. [2018-02-02 09:48:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:40,566 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2018-02-02 09:48:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:48:40,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 09:48:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:40,567 INFO L225 Difference]: With dead ends: 159 [2018-02-02 09:48:40,567 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 09:48:40,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:48:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 09:48:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 130. [2018-02-02 09:48:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 09:48:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-02-02 09:48:40,571 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 33 [2018-02-02 09:48:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:40,571 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-02-02 09:48:40,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:48:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-02-02 09:48:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:48:40,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:40,572 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, 1, 1, 1, 1] [2018-02-02 09:48:40,572 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-02-02 09:48:40,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:40,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:40,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:40,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:48:40,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:40,643 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 09:48:40,644 INFO L182 omatonBuilderFactory]: Interpolants [2418#true, 2419#false, 2420#(= 0 |main_#t~malloc19.offset|), 2421#(= 0 main_~numbers~0.offset), 2422#(= 0 |lis_#in~a.offset|), 2423#(= lis_~a.offset 0), 2424#(and (= lis_~a.offset 0) (= lis_~j~0 0)), 2425#(and (= lis_~a.offset 0) (= lis_~j~0 0) (<= (+ lis_~j~0 1) lis_~i~0)), 2426#(and (= lis_~a.offset 0) (= lis_~j~0 0) (<= (+ (* 4 lis_~j~0) lis_~a.offset 8) (select |#length| lis_~a.base)))] [2018-02-02 09:48:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:40,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:48:40,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:48:40,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:48:40,645 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 9 states. [2018-02-02 09:48:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:40,713 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2018-02-02 09:48:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:48:40,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 09:48:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:40,715 INFO L225 Difference]: With dead ends: 185 [2018-02-02 09:48:40,716 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 09:48:40,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:48:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 09:48:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 138. [2018-02-02 09:48:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 09:48:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-02-02 09:48:40,719 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 34 [2018-02-02 09:48:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:40,720 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-02-02 09:48:40,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:48:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-02-02 09:48:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:48:40,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:40,721 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, 1, 1, 1, 1, 1] [2018-02-02 09:48:40,721 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1763028567, now seen corresponding path program 1 times [2018-02-02 09:48:40,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:40,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:48:40,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:40,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:48:40,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:40,843 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 09:48:40,843 INFO L182 omatonBuilderFactory]: Interpolants [2768#(and (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~a.base)) (= lis_~a.offset 0) (<= 1 lis_~i~0)), 2760#true, 2761#false, 2762#(and (= (select |#valid| |main_#t~malloc19.base|) 1) (= 0 |main_#t~malloc19.offset|) (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc19.base|))), 2763#(and (= (select |#valid| main_~numbers~0.base) 1) (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 2764#(and (= 0 |lis_#in~a.offset|) (= (select |#valid| |lis_#in~a.base|) 1) (<= (* 4 |lis_#in~N|) (select |#length| |lis_#in~a.base|))), 2765#(and (= lis_~a.offset 0) (<= (* 4 lis_~N) (select |#length| lis_~a.base)) (= (select |#valid| lis_~a.base) 1)), 2766#(and (= lis_~a.offset 0) (<= (* 4 lis_~N) (select |#length| lis_~a.base))), 2767#(and (<= (+ (* 4 lis_~i~0) 4) (select |#length| lis_~a.base)) (= lis_~a.offset 0) (= lis_~j~0 0))] [2018-02-02 09:48:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:48:40,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:48:40,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:48:40,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:48:40,844 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 9 states. [2018-02-02 09:48:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:41,110 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 09:48:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:48:41,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-02 09:48:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:41,111 INFO L225 Difference]: With dead ends: 162 [2018-02-02 09:48:41,111 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 09:48:41,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:48:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 09:48:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2018-02-02 09:48:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 09:48:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-02 09:48:41,113 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 38 [2018-02-02 09:48:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:41,114 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-02 09:48:41,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:48:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-02 09:48:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:48:41,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:41,114 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:41,114 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-02-02 09:48:41,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:41,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:41,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:41,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:48:41,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:41,135 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 09:48:41,135 INFO L182 omatonBuilderFactory]: Interpolants [3057#true, 3058#false, 3059#(not |lis_#t~short11|)] [2018-02-02 09:48:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:41,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:48:41,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:48:41,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:48:41,136 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 3 states. [2018-02-02 09:48:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:41,141 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2018-02-02 09:48:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:48:41,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-02 09:48:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:41,142 INFO L225 Difference]: With dead ends: 117 [2018-02-02 09:48:41,142 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 09:48:41,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:48:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 09:48:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 09:48:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 09:48:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-02 09:48:41,146 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 38 [2018-02-02 09:48:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:41,146 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-02 09:48:41,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:48:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-02 09:48:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:48:41,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:41,147 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:41,147 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-02-02 09:48:41,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:41,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:41,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:41,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:48:41,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:41,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 09:48:41,240 INFO L182 omatonBuilderFactory]: Interpolants [3296#(= 0 |main_#t~malloc19.offset|), 3297#(= 0 main_~numbers~0.offset), 3298#(= 0 |lis_#in~a.offset|), 3299#(= lis_~a.offset 0), 3300#(and (= lis_~a.offset 0) (= 0 |lis_#t~malloc0.offset|)), 3301#(and (= lis_~a.offset 0) (= lis_~best~0.offset 0)), 3302#(and (= lis_~a.offset 0) (<= (+ lis_~j~0 1) lis_~i~0) (= lis_~best~0.offset 0)), 3303#(and (<= (+ lis_~j~0 1) lis_~i~0) (<= 0 lis_~j~0) (= lis_~best~0.offset 0)), 3304#(and (<= (+ (* 4 lis_~j~0) lis_~best~0.offset 8) (select |#length| lis_~best~0.base)) (<= 0 lis_~j~0) (= lis_~best~0.offset 0)), 3294#true, 3295#false] [2018-02-02 09:48:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:41,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:48:41,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:48:41,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:48:41,241 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 11 states. [2018-02-02 09:48:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:41,349 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-02-02 09:48:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:48:41,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 09:48:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:41,349 INFO L225 Difference]: With dead ends: 116 [2018-02-02 09:48:41,349 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 09:48:41,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:48:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 09:48:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-02-02 09:48:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 09:48:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-02-02 09:48:41,352 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 38 [2018-02-02 09:48:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:41,353 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-02-02 09:48:41,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:48:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-02-02 09:48:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:48:41,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:41,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:41,354 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-02-02 09:48:41,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:41,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:41,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:41,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:48:41,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:41,407 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 09:48:41,407 INFO L182 omatonBuilderFactory]: Interpolants [3552#true, 3553#false, 3554#(= 0 |main_#t~malloc19.offset|), 3555#(= 0 main_~numbers~0.offset), 3556#(= 0 |lis_#in~a.offset|), 3557#(= lis_~a.offset 0), 3558#(and (= lis_~a.offset 0) (= lis_~i~0 1)), 3559#(and (= lis_~a.offset 0) (= lis_~i~0 1) (<= 0 (+ (* 4 lis_~j~0) lis_~a.offset))), 3560#(and (<= 4 (+ (* 4 lis_~j~0) lis_~a.offset)) (= lis_~a.offset 0) (= lis_~i~0 1))] [2018-02-02 09:48:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:41,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:48:41,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:48:41,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:48:41,408 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 9 states. [2018-02-02 09:48:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:41,477 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-02-02 09:48:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:48:41,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-02 09:48:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:41,478 INFO L225 Difference]: With dead ends: 142 [2018-02-02 09:48:41,478 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 09:48:41,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:48:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 09:48:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2018-02-02 09:48:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:48:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2018-02-02 09:48:41,481 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 42 [2018-02-02 09:48:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:41,481 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2018-02-02 09:48:41,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:48:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2018-02-02 09:48:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:48:41,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:41,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:41,482 INFO L371 AbstractCegarLoop]: === Iteration 16 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-02-02 09:48:41,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:41,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:41,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:41,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:48:41,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:41,709 INFO L182 omatonBuilderFactory]: Interpolants [3848#true, 3849#false, 3850#(<= main_~array_size~0 1), 3851#(and (= lis_~max~0 0) (<= lis_~N |lis_#in~N|)), 3852#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= 0 |lis_#t~malloc0.offset|) (= lis_~max~0 0) (<= lis_~N |lis_#in~N|)), 3853#(and (= (select |#valid| lis_~best~0.base) 1) (= lis_~max~0 0) (= lis_~best~0.offset 0) (<= lis_~N |lis_#in~N|)), 3854#(and (not (= lis_~best~0.base |lis_#t~malloc1.base|)) (= lis_~max~0 0) (= lis_~best~0.offset 0) (<= lis_~N |lis_#in~N|)), 3855#(and (or (= lis_~max~0 0) (not (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)))) (not (= lis_~best~0.base lis_~prev~0.base)) (or (<= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0) (<= lis_~N |lis_#in~N|)) (= lis_~best~0.offset 0)), 3856#(and (or (<= (+ lis_~i~0 1) |lis_#in~N|) (<= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0)) (or (= lis_~max~0 0) (not (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)))) (not (= lis_~best~0.base lis_~prev~0.base)) (= lis_~best~0.offset 0)), 3857#(and (or (and (<= (+ lis_~i~0 1) |lis_#in~N|) (< 0 (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset))) (or (and (= 1 (select (select (store |#memory_int| lis_~prev~0.base (store (select |#memory_int| lis_~prev~0.base) (+ (* 4 lis_~i~0) lis_~prev~0.offset) lis_~i~0)) lis_~best~0.base) (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= lis_~max~0 0)) (not (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)))) (not (= lis_~best~0.base lis_~prev~0.base)) (= lis_~best~0.offset 0)), 3858#(and (or (and (<= (+ lis_~i~0 1) |lis_#in~N|) (< 0 (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset))) (or (and (= 1 (select (select |#memory_int| lis_~best~0.base) (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= lis_~max~0 0)) (not (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)))) (= lis_~best~0.offset 0)), 3859#(and (or (and (= 1 (select (select |#memory_int| lis_~best~0.base) 0)) (= lis_~max~0 0)) (<= 5 (+ (* 4 |lis_#in~N|) lis_~best~0.offset))) (= lis_~best~0.offset 0)), 3860#(and (or (and (= 1 (select (select |#memory_int| lis_~best~0.base) (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= lis_~max~0 0)) (<= 5 (+ (* 4 |lis_#in~N|) lis_~best~0.offset))) (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= lis_~best~0.offset 0)), 3861#(or (<= 2 |lis_#in~N|) (and (= |lis_#t~mem16| 1) (= lis_~max~0 0))), 3862#(<= 2 |lis_#in~N|)] [2018-02-02 09:48:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:41,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:48:41,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:48:41,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:48:41,710 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand 15 states. [2018-02-02 09:48:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:42,437 INFO L93 Difference]: Finished difference Result 239 states and 266 transitions. [2018-02-02 09:48:42,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:48:42,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-02 09:48:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:42,469 INFO L225 Difference]: With dead ends: 239 [2018-02-02 09:48:42,469 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 09:48:42,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:48:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 09:48:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 135. [2018-02-02 09:48:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:48:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-02-02 09:48:42,474 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 44 [2018-02-02 09:48:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:42,474 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-02-02 09:48:42,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:48:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-02-02 09:48:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:48:42,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:42,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:42,476 INFO L371 AbstractCegarLoop]: === Iteration 17 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1393314987, now seen corresponding path program 1 times [2018-02-02 09:48:42,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:42,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:42,752 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 09:48:42,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:42,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:48:42,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:42,753 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 09:48:42,753 INFO L182 omatonBuilderFactory]: Interpolants [4288#(and (= lis_~i~0 1) (= lis_~best~0.offset 0) (or (and (= 1 (select (select |#memory_int| lis_~best~0.base) 0)) (= lis_~max~0 0)) (<= 5 (+ lis_~best~0.offset (* 4 lis_~N))))), 4289#(and (= 1 (select (select |#memory_int| lis_~best~0.base) 0)) (= lis_~max~0 0) (= lis_~best~0.offset 0)), 4290#(and (= 1 (select (select |#memory_int| lis_~best~0.base) (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)) (= lis_~max~0 0) (= lis_~best~0.offset 0)), 4291#(and (= |lis_#t~mem16| 1) (= lis_~max~0 0)), 4277#true, 4278#false, 4279#(= lis_~max~0 0), 4280#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= 0 |lis_#t~malloc0.offset|) (= lis_~max~0 0)), 4281#(and (= (select |#valid| lis_~best~0.base) 1) (= lis_~max~0 0) (= lis_~best~0.offset 0)), 4282#(and (not (= lis_~best~0.base |lis_#t~malloc1.base|)) (= lis_~max~0 0) (= lis_~best~0.offset 0)), 4283#(and (or (and (not (= lis_~best~0.base lis_~prev~0.base)) (= lis_~max~0 0)) (not (= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0))) (= lis_~best~0.offset 0)), 4284#(and (or (<= (+ lis_~i~0 1) lis_~N) (<= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0)) (or (and (not (= lis_~best~0.base lis_~prev~0.base)) (= lis_~max~0 0)) (not (= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0))) (= lis_~best~0.offset 0)), 4285#(and (or (= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0) (and (<= (+ lis_~i~0 1) lis_~N) (< 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)))) (or (not (= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0)) (and (not (= lis_~best~0.base lis_~prev~0.base)) (= 1 (select (select (store |#memory_int| lis_~prev~0.base (store (select |#memory_int| lis_~prev~0.base) (+ (* 4 lis_~i~0) lis_~prev~0.offset) lis_~i~0)) lis_~best~0.base) (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= lis_~max~0 0))) (= lis_~best~0.offset 0)), 4286#(and (or (and (= 1 (select (select |#memory_int| lis_~best~0.base) (+ (* 4 lis_~i~0) lis_~best~0.offset))) (= lis_~max~0 0)) (not (= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0))) (or (= (+ (* 4 lis_~i~0) lis_~best~0.offset) 0) (and (<= (+ lis_~i~0 1) lis_~N) (< 0 (+ (* 4 lis_~i~0) lis_~best~0.offset)))) (= lis_~best~0.offset 0)), 4287#(and (= lis_~best~0.offset 0) (or (and (= 1 (select (select |#memory_int| lis_~best~0.base) 0)) (= lis_~max~0 0)) (<= 5 (+ lis_~best~0.offset (* 4 lis_~N)))))] [2018-02-02 09:48:42,753 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 09:48:42,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:48:42,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:48:42,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:48:42,753 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 15 states. [2018-02-02 09:48:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:43,180 INFO L93 Difference]: Finished difference Result 247 states and 280 transitions. [2018-02-02 09:48:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:48:43,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-02 09:48:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:43,181 INFO L225 Difference]: With dead ends: 247 [2018-02-02 09:48:43,181 INFO L226 Difference]: Without dead ends: 247 [2018-02-02 09:48:43,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:48:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-02 09:48:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 142. [2018-02-02 09:48:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 09:48:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-02-02 09:48:43,184 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 44 [2018-02-02 09:48:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:43,184 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-02-02 09:48:43,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:48:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-02-02 09:48:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:48:43,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:43,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:43,185 INFO L371 AbstractCegarLoop]: === Iteration 18 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2022275116, now seen corresponding path program 1 times [2018-02-02 09:48:43,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:43,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:43,354 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 09:48:43,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:43,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:48:43,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:43,354 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 09:48:43,354 INFO L182 omatonBuilderFactory]: Interpolants [4709#true, 4710#false, 4711#(= |#valid| |old(#valid)|), 4712#(and (= (select |#valid| |main_#t~malloc19.base|) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc19.base| 0))), 4713#(and (= (select |#valid| |lis_#t~malloc0.base|) 1) (= (store |#valid| |lis_#t~malloc0.base| 0) |old(#valid)|)), 4714#(and (= (store (store |#valid| |lis_#t~malloc1.base| (select |old(#valid)| |lis_#t~malloc1.base|)) |lis_#t~malloc0.base| (select |old(#valid)| |lis_#t~malloc0.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |lis_#t~malloc1.base|)) (= (select (store |#valid| |lis_#t~malloc0.base| 0) |lis_#t~malloc0.base|) (select |old(#valid)| |lis_#t~malloc0.base|)) (not (= |lis_#t~malloc0.base| |lis_#t~malloc1.base|))), 4715#(= (store |#valid| |lis_#t~malloc1.base| 0) |old(#valid)|), 4716#(= (store |#valid| |main_#t~malloc19.base| (select (store |#valid| |main_#t~malloc19.base| 0) |main_#t~malloc19.base|)) |old(#valid)|)] [2018-02-02 09:48:43,355 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 09:48:43,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:48:43,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:48:43,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:43,355 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 8 states. [2018-02-02 09:48:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:43,469 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-02-02 09:48:43,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:48:43,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 09:48:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:43,470 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:48:43,470 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 09:48:43,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:48:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 09:48:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 09:48:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 09:48:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-02 09:48:43,472 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 46 [2018-02-02 09:48:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:43,472 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-02 09:48:43,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:48:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-02 09:48:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:48:43,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:43,472 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 09:48:43,472 INFO L371 AbstractCegarLoop]: === Iteration 19 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1787354498, now seen corresponding path program 1 times [2018-02-02 09:48:43,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:43,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:43,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:43,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:48:43,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:43,538 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 09:48:43,538 INFO L182 omatonBuilderFactory]: Interpolants [4944#(and (= lis_~a.offset 0) (<= lis_~i~0 1)), 4945#(and (<= (* 4 lis_~i~0) (+ (* 4 lis_~j~0) lis_~a.offset 4)) (= lis_~a.offset 0)), 4946#(and (= lis_~a.offset 0) (<= (* 4 lis_~i~0) (+ (* 4 lis_~j~0) lis_~a.offset))), 4936#true, 4937#false, 4938#(= 0 |main_#t~malloc19.offset|), 4939#(= 0 main_~numbers~0.offset), 4940#(= 0 |lis_#in~a.offset|), 4941#(= lis_~a.offset 0), 4942#(and (= lis_~a.offset 0) (= lis_~j~0 0)), 4943#(and (= lis_~a.offset 0) (<= lis_~i~0 0))] [2018-02-02 09:48:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:48:43,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:48:43,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:48:43,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:48:43,538 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 11 states. [2018-02-02 09:48:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:43,691 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-02-02 09:48:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:48:43,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 09:48:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:43,691 INFO L225 Difference]: With dead ends: 109 [2018-02-02 09:48:43,692 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 09:48:43,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:48:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 09:48:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2018-02-02 09:48:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 09:48:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-02 09:48:43,693 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 47 [2018-02-02 09:48:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:43,694 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-02 09:48:43,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:48:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-02 09:48:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 09:48:43,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:43,694 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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 09:48:43,695 INFO L371 AbstractCegarLoop]: === Iteration 20 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1878068012, now seen corresponding path program 2 times [2018-02-02 09:48:43,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:43,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:48:43,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:43,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:43,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:43,774 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 09:48:43,774 INFO L182 omatonBuilderFactory]: Interpolants [5152#(= 0 main_~numbers~0.offset), 5153#(= 0 |lis_#in~a.offset|), 5154#(= lis_~a.offset 0), 5155#(and (= lis_~a.offset 0) (= lis_~i~0 0)), 5156#(and (= lis_~a.offset 0) (<= lis_~i~0 1)), 5157#(and (= lis_~a.offset 0) (<= lis_~i~0 2)), 5158#(and (<= lis_~N 2) (= lis_~a.offset 0)), 5159#(and (<= (* 4 lis_~i~0) (+ (* 4 lis_~j~0) lis_~a.offset 4)) (= lis_~a.offset 0)), 5160#(and (= lis_~a.offset 0) (<= (* 4 lis_~i~0) (+ (* 4 lis_~j~0) lis_~a.offset))), 5149#true, 5150#false, 5151#(= 0 |main_#t~malloc19.offset|)] [2018-02-02 09:48:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:48:43,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:48:43,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:48:43,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:48:43,775 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 12 states. [2018-02-02 09:48:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:43,943 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-02-02 09:48:43,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:48:43,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-02 09:48:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:43,943 INFO L225 Difference]: With dead ends: 193 [2018-02-02 09:48:43,944 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 09:48:43,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:48:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 09:48:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 78. [2018-02-02 09:48:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 09:48:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-02-02 09:48:43,946 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 55 [2018-02-02 09:48:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:43,946 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-02-02 09:48:43,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:48:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-02-02 09:48:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:48:43,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:43,947 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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 09:48:43,947 INFO L371 AbstractCegarLoop]: === Iteration 21 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:48:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash 53164877, now seen corresponding path program 3 times [2018-02-02 09:48:43,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:43,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 09:48:44,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:44,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 09:48:44,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:44,005 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 09:48:44,005 INFO L182 omatonBuilderFactory]: Interpolants [5464#true, 5465#false, 5466#(<= (+ (* 4 lis_~i~0) lis_~a.offset 4) (select |#length| lis_~a.base)), 5467#(and (<= (+ (* 4 lis_~i~0) lis_~a.offset 4) (select |#length| lis_~a.base)) (<= 0 (+ (* 4 lis_~j~0) lis_~a.offset))), 5468#(and (<= (+ (* 4 lis_~i~0) lis_~a.offset 4) (select |#length| lis_~a.base)) (<= 4 (+ (* 4 lis_~j~0) lis_~a.offset))), 5469#(and (<= 4 (+ (* 4 lis_~j~0) lis_~a.offset)) (<= (+ (* 4 lis_~j~0) lis_~a.offset 8) (select |#length| lis_~a.base)))] [2018-02-02 09:48:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 09:48:44,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:44,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:44,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:44,005 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2018-02-02 09:48:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:44,049 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-02 09:48:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:48:44,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-02-02 09:48:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:44,049 INFO L225 Difference]: With dead ends: 89 [2018-02-02 09:48:44,049 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:48:44,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:48:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:48:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:48:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:48:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:48:44,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-02-02 09:48:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:44,050 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:48:44,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:48:44,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:48:44,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:48:44 BoogieIcfgContainer [2018-02-02 09:48:44,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:48:44,055 INFO L168 Benchmark]: Toolchain (without parser) took 6785.68 ms. Allocated memory was 402.7 MB in the beginning and 792.2 MB in the end (delta: 389.5 MB). Free memory was 356.7 MB in the beginning and 623.6 MB in the end (delta: -266.9 MB). Peak memory consumption was 122.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:44,056 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:48:44,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.87 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 346.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:44,056 INFO L168 Benchmark]: Boogie Preprocessor took 31.34 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 344.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:44,056 INFO L168 Benchmark]: RCFGBuilder took 279.19 ms. Allocated memory is still 402.7 MB. Free memory was 344.7 MB in the beginning and 318.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:44,056 INFO L168 Benchmark]: TraceAbstraction took 6300.16 ms. Allocated memory was 402.7 MB in the beginning and 792.2 MB in the end (delta: 389.5 MB). Free memory was 318.2 MB in the beginning and 623.6 MB in the end (delta: -305.4 MB). Peak memory consumption was 84.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:44,057 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.17 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.87 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 346.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.34 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 344.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.19 ms. Allocated memory is still 402.7 MB. Free memory was 344.7 MB in the beginning and 318.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6300.16 ms. Allocated memory was 402.7 MB in the beginning and 792.2 MB in the end (delta: 389.5 MB). Free memory was 318.2 MB in the beginning and 623.6 MB in the end (delta: -305.4 MB). Peak memory consumption was 84.1 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: 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: 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: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 23 error locations. SAFE Result, 6.2s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1076 SDtfs, 4518 SDslu, 3291 SDs, 0 SdLazy, 2760 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 125/179 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, 21 MinimizatonAttempts, 563 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 186250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 125/179 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/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-48-44-064.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-48-44-064.csv Received shutdown request...