java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:59:31,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:59:31,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:59:31,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:59:31,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:59:31,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:59:31,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:59:31,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:59:31,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:59:31,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:59:31,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:59:31,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:59:31,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:59:31,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:59:31,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:59:31,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:59:31,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:59:31,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:59:31,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:59:31,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:59:31,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:59:31,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:59:31,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:59:31,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:59:31,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:59:31,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:59:31,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:59:31,356 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:59:31,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:59:31,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:59:31,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:59:31,357 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 14:59:31,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:59:31,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:59:31,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:59:31,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:59:31,368 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:59:31,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:59:31,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:59:31,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:59:31,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:59:31,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:59:31,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:59:31,369 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:59:31,370 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:59:31,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:59:31,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:59:31,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:59:31,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:59:31,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:59:31,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:59:31,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:59:31,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:59:31,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:59:31,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:59:31,407 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:59:31,410 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:59:31,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:59:31,412 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:59:31,412 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-04 14:59:31,563 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:59:31,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:59:31,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:31,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:59:31,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:59:31,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31, skipping insertion in model container [2018-02-04 14:59:31,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,583 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:31,609 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:31,692 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:31,706 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:31,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31 WrapperNode [2018-02-04 14:59:31,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:31,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:59:31,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:59:31,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:59:31,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... [2018-02-04 14:59:31,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:59:31,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:59:31,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:59:31,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:59:31,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:59:31,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:59:31,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:59:31,771 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-04 14:59:31,771 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:59:31,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:59:31,771 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:59:31,771 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:59:31,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:59:31,998 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:59:31,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:31 BoogieIcfgContainer [2018-02-04 14:59:31,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:59:32,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:59:32,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:59:32,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:59:32,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:59:31" (1/3) ... [2018-02-04 14:59:32,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcf323a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:32, skipping insertion in model container [2018-02-04 14:59:32,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:31" (2/3) ... [2018-02-04 14:59:32,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcf323a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:32, skipping insertion in model container [2018-02-04 14:59:32,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:31" (3/3) ... [2018-02-04 14:59:32,005 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:32,012 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:59:32,018 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 14:59:32,048 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:59:32,048 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:59:32,048 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:59:32,048 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:59:32,048 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:59:32,048 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:59:32,048 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:59:32,049 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:59:32,049 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:59:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-04 14:59:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:59:32,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:32,070 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-04 14:59:32,070 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-04 14:59:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-02-04 14:59:32,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:32,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:32,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:32,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,341 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-04 14:59:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:59:32,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:59:32,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:59:32,352 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-04 14:59:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:32,458 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 14:59:32,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:59:32,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 14:59:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:32,467 INFO L225 Difference]: With dead ends: 77 [2018-02-04 14:59:32,467 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 14:59:32,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 14:59:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 14:59:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 14:59:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 14:59:32,496 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-02-04 14:59:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:32,496 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 14:59:32,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:59:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 14:59:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:59:32,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:32,497 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-04 14:59:32,497 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-04 14:59:32,497 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-02-04 14:59:32,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:32,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:32,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:59:32,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,620 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-04 14:59:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:59:32,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:59:32,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:59:32,623 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-04 14:59:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:32,832 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-04 14:59:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:59:32,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 14:59:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:32,835 INFO L225 Difference]: With dead ends: 96 [2018-02-04 14:59:32,835 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 14:59:32,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:59:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 14:59:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-02-04 14:59:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 14:59:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 14:59:32,841 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-02-04 14:59:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:32,841 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 14:59:32,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:59:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 14:59:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:59:32,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:32,841 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-04 14:59:32,842 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-04 14:59:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-02-04 14:59:32,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:32,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:32,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:32,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,881 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-04 14:59:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:32,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:59:32,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:59:32,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:59:32,881 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-02-04 14:59:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:32,912 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-04 14:59:32,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:59:32,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 14:59:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:32,913 INFO L225 Difference]: With dead ends: 80 [2018-02-04 14:59:32,913 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 14:59:32,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 14:59:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 14:59:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 14:59:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-04 14:59:32,918 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-02-04 14:59:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:32,918 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-04 14:59:32,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:59:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-04 14:59:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:59:32,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:32,918 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-04 14:59:32,918 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-04 14:59:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-02-04 14:59:32,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:32,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:33,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:59:33,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,011 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-04 14:59:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:59:33,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:59:33,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:33,012 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-02-04 14:59:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:33,251 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-04 14:59:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:33,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 14:59:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:33,252 INFO L225 Difference]: With dead ends: 97 [2018-02-04 14:59:33,252 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 14:59:33,253 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-04 14:59:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 14:59:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-04 14:59:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 14:59:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-04 14:59:33,256 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-02-04 14:59:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:33,256 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-04 14:59:33,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:59:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-04 14:59:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:59:33,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:33,257 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:33,257 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-04 14:59:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-02-04 14:59:33,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:33,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:33,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:59:33,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,309 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-04 14:59:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:59:33,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:59:33,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:33,311 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-02-04 14:59:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:33,398 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-04 14:59:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:59:33,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:59:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:33,399 INFO L225 Difference]: With dead ends: 128 [2018-02-04 14:59:33,399 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 14:59:33,400 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-04 14:59:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 14:59:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-02-04 14:59:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 14:59:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-02-04 14:59:33,410 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-02-04 14:59:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:33,410 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-02-04 14:59:33,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:59:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-02-04 14:59:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:59:33,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:33,411 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-04 14:59:33,411 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-04 14:59:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-02-04 14:59:33,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:33,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:33,503 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-04 14:59:33,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:33,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 14:59:33,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,503 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-04 14:59:33,503 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-04 14:59:33,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:33,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:33,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:33,504 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 9 states. [2018-02-04 14:59:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:33,640 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-04 14:59:33,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:33,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 14:59:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:33,641 INFO L225 Difference]: With dead ends: 118 [2018-02-04 14:59:33,642 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 14:59:33,642 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-04 14:59:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 14:59:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-02-04 14:59:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 14:59:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-04 14:59:33,646 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-02-04 14:59:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:33,646 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-04 14:59:33,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-04 14:59:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:59:33,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:33,647 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:33,647 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-04 14:59:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-02-04 14:59:33,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:33,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:33,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:59:33,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,692 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-04 14:59:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:59:33,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:59:33,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:33,693 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-02-04 14:59:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:33,746 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-02-04 14:59:33,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:59:33,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:59:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:33,748 INFO L225 Difference]: With dead ends: 117 [2018-02-04 14:59:33,748 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 14:59:33,748 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-04 14:59:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 14:59:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-04 14:59:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 14:59:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-04 14:59:33,752 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-02-04 14:59:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:33,752 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-04 14:59:33,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:59:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-04 14:59:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:59:33,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:33,753 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-04 14:59:33,753 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-04 14:59:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-02-04 14:59:33,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:33,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:33,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 14:59:33,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,870 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-04 14:59:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:33,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:59:33,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:59:33,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:33,871 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 8 states. [2018-02-04 14:59:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:34,013 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-04 14:59:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:59:34,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 14:59:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:34,014 INFO L225 Difference]: With dead ends: 112 [2018-02-04 14:59:34,014 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 14:59:34,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:59:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 14:59:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-02-04 14:59:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 14:59:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-02-04 14:59:34,018 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-02-04 14:59:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:34,018 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-02-04 14:59:34,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:59:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-02-04 14:59:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:59:34,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:34,019 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-04 14:59:34,019 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-04 14:59:34,019 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-02-04 14:59:34,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:34,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:34,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:34,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 14:59:34,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:34,062 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-04 14:59:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:34,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:59:34,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:59:34,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:34,062 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 6 states. [2018-02-04 14:59:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:34,158 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-02-04 14:59:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:59:34,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 14:59:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:34,159 INFO L225 Difference]: With dead ends: 185 [2018-02-04 14:59:34,159 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 14:59:34,159 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-04 14:59:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 14:59:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 115. [2018-02-04 14:59:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 14:59:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-02-04 14:59:34,163 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 28 [2018-02-04 14:59:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:34,164 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-02-04 14:59:34,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:59:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-02-04 14:59:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 14:59:34,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:34,165 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-04 14:59:34,165 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-04 14:59:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-02-04 14:59:34,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:34,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:34,491 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-04 14:59:34,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:34,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:34,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:34,492 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-04 14:59:34,492 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-04 14:59:34,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:34,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:34,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:34,493 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 13 states. [2018-02-04 14:59:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:34,830 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2018-02-04 14:59:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 14:59:34,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-04 14:59:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:34,831 INFO L225 Difference]: With dead ends: 159 [2018-02-04 14:59:34,831 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 14:59:34,832 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-04 14:59:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 14:59:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 130. [2018-02-04 14:59:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 14:59:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-02-04 14:59:34,835 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 33 [2018-02-04 14:59:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:34,836 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-02-04 14:59:34,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-02-04 14:59:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 14:59:34,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:34,836 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-04 14:59:34,836 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-04 14:59:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-02-04 14:59:34,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:34,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:34,900 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-04 14:59:34,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:34,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:59:34,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:34,901 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-04 14:59:34,901 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-04 14:59:34,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:34,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:34,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:34,902 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 9 states. [2018-02-04 14:59:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:34,976 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2018-02-04 14:59:34,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:34,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 14:59:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:34,977 INFO L225 Difference]: With dead ends: 185 [2018-02-04 14:59:34,977 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 14:59:34,978 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-04 14:59:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 14:59:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 138. [2018-02-04 14:59:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 14:59:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-02-04 14:59:34,982 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 34 [2018-02-04 14:59:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:34,982 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-02-04 14:59:34,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-02-04 14:59:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 14:59:34,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:34,984 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-04 14:59:34,984 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-04 14:59:34,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1763028567, now seen corresponding path program 1 times [2018-02-04 14:59:34,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:34,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:35,093 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-04 14:59:35,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:35,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 14:59:35,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:35,094 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-04 14:59:35,094 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-04 14:59:35,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:35,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:35,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:35,095 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 9 states. [2018-02-04 14:59:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:35,330 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 14:59:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:35,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-04 14:59:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:35,332 INFO L225 Difference]: With dead ends: 162 [2018-02-04 14:59:35,332 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 14:59:35,333 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-04 14:59:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 14:59:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2018-02-04 14:59:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 14:59:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-04 14:59:35,340 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 38 [2018-02-04 14:59:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:35,340 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-04 14:59:35,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-04 14:59:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 14:59:35,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:35,342 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-04 14:59:35,342 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-04 14:59:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-02-04 14:59:35,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:35,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:35,377 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-04 14:59:35,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:35,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:35,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:35,378 INFO L182 omatonBuilderFactory]: Interpolants [3057#true, 3058#false, 3059#(not |lis_#t~short11|)] [2018-02-04 14:59:35,378 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-04 14:59:35,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:59:35,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:59:35,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:59:35,379 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 3 states. [2018-02-04 14:59:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:35,384 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2018-02-04 14:59:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:59:35,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-04 14:59:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:35,385 INFO L225 Difference]: With dead ends: 117 [2018-02-04 14:59:35,385 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 14:59:35,386 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-04 14:59:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 14:59:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 14:59:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 14:59:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-04 14:59:35,389 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 38 [2018-02-04 14:59:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:35,389 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-04 14:59:35,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:59:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-04 14:59:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 14:59:35,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:35,390 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-04 14:59:35,390 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-04 14:59:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-02-04 14:59:35,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:35,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:35,482 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-04 14:59:35,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:35,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:59:35,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:35,482 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-04 14:59:35,483 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-04 14:59:35,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:59:35,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:59:35,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:59:35,483 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 11 states. [2018-02-04 14:59:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:35,603 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-02-04 14:59:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:59:35,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 14:59:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:35,604 INFO L225 Difference]: With dead ends: 116 [2018-02-04 14:59:35,604 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 14:59:35,604 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-04 14:59:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 14:59:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-02-04 14:59:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 14:59:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-02-04 14:59:35,607 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 38 [2018-02-04 14:59:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:35,608 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-02-04 14:59:35,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:59:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-02-04 14:59:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 14:59:35,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:35,609 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-04 14:59:35,609 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-04 14:59:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-02-04 14:59:35,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:35,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:35,661 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-04 14:59:35,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:35,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:59:35,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:35,662 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-04 14:59:35,662 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-04 14:59:35,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:35,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:35,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:35,663 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 9 states. [2018-02-04 14:59:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:35,722 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-02-04 14:59:35,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:35,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 14:59:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:35,723 INFO L225 Difference]: With dead ends: 142 [2018-02-04 14:59:35,723 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 14:59:35,723 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-04 14:59:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 14:59:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2018-02-04 14:59:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 14:59:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2018-02-04 14:59:35,725 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 42 [2018-02-04 14:59:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:35,726 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2018-02-04 14:59:35,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2018-02-04 14:59:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:59:35,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:35,726 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-04 14:59:35,726 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-04 14:59:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-02-04 14:59:35,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:35,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:35,990 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-04 14:59:35,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:35,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 14:59:35,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:35,990 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-04 14:59:35,990 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-04 14:59:35,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:59:35,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:59:35,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:59:35,991 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand 15 states. [2018-02-04 14:59:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:36,688 INFO L93 Difference]: Finished difference Result 239 states and 266 transitions. [2018-02-04 14:59:36,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 14:59:36,688 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 14:59:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:36,689 INFO L225 Difference]: With dead ends: 239 [2018-02-04 14:59:36,689 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 14:59:36,690 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-04 14:59:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 14:59:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 135. [2018-02-04 14:59:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 14:59:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-02-04 14:59:36,692 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 44 [2018-02-04 14:59:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:36,693 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-02-04 14:59:36,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:59:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-02-04 14:59:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:59:36,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:36,693 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-04 14:59:36,693 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-04 14:59:36,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1393314987, now seen corresponding path program 1 times [2018-02-04 14:59:36,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:36,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:36,955 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-04 14:59:36,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:36,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 14:59:36,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:36,958 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-04 14:59:36,958 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-04 14:59:36,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:59:36,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:59:36,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:59:36,959 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 15 states. [2018-02-04 14:59:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:37,482 INFO L93 Difference]: Finished difference Result 247 states and 280 transitions. [2018-02-04 14:59:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 14:59:37,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 14:59:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:37,483 INFO L225 Difference]: With dead ends: 247 [2018-02-04 14:59:37,483 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 14:59:37,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-02-04 14:59:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 14:59:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 142. [2018-02-04 14:59:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 14:59:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-02-04 14:59:37,486 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 44 [2018-02-04 14:59:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:37,486 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-02-04 14:59:37,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:59:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-02-04 14:59:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 14:59:37,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:37,487 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-04 14:59:37,487 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-04 14:59:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2022275116, now seen corresponding path program 1 times [2018-02-04 14:59:37,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:37,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:37,634 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-04 14:59:37,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:37,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:59:37,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:37,635 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-04 14:59:37,635 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-04 14:59:37,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:59:37,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:59:37,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:37,636 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 8 states. [2018-02-04 14:59:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:37,729 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-02-04 14:59:37,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:37,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 14:59:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:37,729 INFO L225 Difference]: With dead ends: 141 [2018-02-04 14:59:37,730 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 14:59:37,730 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-04 14:59:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 14:59:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 14:59:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 14:59:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-04 14:59:37,732 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 46 [2018-02-04 14:59:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:37,732 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-04 14:59:37,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:59:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-04 14:59:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 14:59:37,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:37,733 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-04 14:59:37,733 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-04 14:59:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1787354498, now seen corresponding path program 1 times [2018-02-04 14:59:37,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:37,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:37,818 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-04 14:59:37,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:37,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:59:37,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:37,818 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-04 14:59:37,818 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-04 14:59:37,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:59:37,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:59:37,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:59:37,819 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 11 states. [2018-02-04 14:59:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:37,970 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-02-04 14:59:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:59:37,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 14:59:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:37,994 INFO L225 Difference]: With dead ends: 109 [2018-02-04 14:59:37,994 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 14:59:37,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:59:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 14:59:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2018-02-04 14:59:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 14:59:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-04 14:59:37,995 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 47 [2018-02-04 14:59:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:37,996 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-04 14:59:37,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:59:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-04 14:59:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 14:59:37,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:37,996 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-04 14:59:37,997 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-04 14:59:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1878068012, now seen corresponding path program 2 times [2018-02-04 14:59:37,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:38,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:38,108 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-04 14:59:38,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:38,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:38,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:38,109 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-04 14:59:38,109 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-04 14:59:38,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:59:38,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:59:38,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:59:38,109 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 12 states. [2018-02-04 14:59:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:38,325 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-02-04 14:59:38,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 14:59:38,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-04 14:59:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:38,325 INFO L225 Difference]: With dead ends: 193 [2018-02-04 14:59:38,325 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 14:59:38,326 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-04 14:59:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 14:59:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 78. [2018-02-04 14:59:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 14:59:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-02-04 14:59:38,327 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 55 [2018-02-04 14:59:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:38,327 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-02-04 14:59:38,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:59:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-02-04 14:59:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 14:59:38,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:38,328 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-04 14:59:38,328 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-04 14:59:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash 53164877, now seen corresponding path program 3 times [2018-02-04 14:59:38,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:38,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:38,360 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-04 14:59:38,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:38,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 14:59:38,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:38,361 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-04 14:59:38,361 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-04 14:59:38,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:59:38,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:59:38,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:38,361 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2018-02-04 14:59:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:38,401 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-04 14:59:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:59:38,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-02-04 14:59:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:38,401 INFO L225 Difference]: With dead ends: 89 [2018-02-04 14:59:38,401 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:59:38,401 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-04 14:59:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:59:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:59:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:59:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:59:38,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-02-04 14:59:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:38,402 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:59:38,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:59:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:59:38,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:59:38,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:59:38 BoogieIcfgContainer [2018-02-04 14:59:38,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:59:38,406 INFO L168 Benchmark]: Toolchain (without parser) took 6842.67 ms. Allocated memory was 399.5 MB in the beginning and 811.1 MB in the end (delta: 411.6 MB). Free memory was 356.4 MB in the beginning and 681.3 MB in the end (delta: -324.9 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:38,407 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:59:38,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.78 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 345.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:38,407 INFO L168 Benchmark]: Boogie Preprocessor took 24.12 ms. Allocated memory is still 399.5 MB. Free memory was 345.7 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:38,407 INFO L168 Benchmark]: RCFGBuilder took 262.19 ms. Allocated memory is still 399.5 MB. Free memory was 344.4 MB in the beginning and 318.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:38,407 INFO L168 Benchmark]: TraceAbstraction took 6405.64 ms. Allocated memory was 399.5 MB in the beginning and 811.1 MB in the end (delta: 411.6 MB). Free memory was 318.4 MB in the beginning and 681.3 MB in the end (delta: -362.9 MB). Peak memory consumption was 48.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:38,408 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 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.78 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 345.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.12 ms. Allocated memory is still 399.5 MB. Free memory was 345.7 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 262.19 ms. Allocated memory is still 399.5 MB. Free memory was 344.4 MB in the beginning and 318.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6405.64 ms. Allocated memory was 399.5 MB in the beginning and 811.1 MB in the end (delta: 411.6 MB). Free memory was 318.4 MB in the beginning and 681.3 MB in the end (delta: -362.9 MB). Peak memory consumption was 48.7 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.3s 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.9s 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, 2.0s 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-04_14-59-38-412.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-04_14-59-38-412.csv Received shutdown request...