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/memsafety/960521-1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:58:25,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:58:25,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:58:25,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:58:25,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:58:25,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:58:25,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:58:25,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:58:25,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:58:25,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:58:25,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:58:25,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:58:25,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:58:25,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:58:25,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:58:25,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:58:25,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:58:25,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:58:25,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:58:25,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:58:25,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:58:25,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:58:25,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:58:25,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:58:25,593 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:58:25,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:58:25,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:58:25,594 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:58:25,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:58:25,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:58:25,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:58:25,595 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 19:58:25,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:58:25,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:58:25,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:58:25,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:58:25,606 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:58:25,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:58:25,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:58:25,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:58:25,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:58:25,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:58:25,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:58:25,607 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:58:25,607 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:58:25,607 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:58:25,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:58:25,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:58:25,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:58:25,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:58:25,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:58:25,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:58:25,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:58:25,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:58:25,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:58:25,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:58:25,642 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:58:25,644 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:58:25,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:58:25,645 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:58:25,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i [2018-02-02 19:58:25,760 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:58:25,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:58:25,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:58:25,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:58:25,768 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:58:25,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7404f6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25, skipping insertion in model container [2018-02-02 19:58:25,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,786 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:58:25,814 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:58:25,897 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:58:25,908 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:58:25,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25 WrapperNode [2018-02-02 19:58:25,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:58:25,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:58:25,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:58:25,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:58:25,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... [2018-02-02 19:58:25,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:58:25,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:58:25,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:58:25,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:58:25,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:58:25,973 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:58:25,973 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:58:25,973 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 19:58:25,973 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:58:25,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:58:25,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:58:26,117 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:58:26,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:58:26 BoogieIcfgContainer [2018-02-02 19:58:26,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:58:26,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:58:26,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:58:26,120 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:58:26,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:58:25" (1/3) ... [2018-02-02 19:58:26,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e4571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:58:26, skipping insertion in model container [2018-02-02 19:58:26,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:58:25" (2/3) ... [2018-02-02 19:58:26,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e4571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:58:26, skipping insertion in model container [2018-02-02 19:58:26,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:58:26" (3/3) ... [2018-02-02 19:58:26,122 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-02-02 19:58:26,128 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:58:26,132 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 19:58:26,153 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:58:26,153 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:58:26,153 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:58:26,153 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:58:26,153 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:58:26,153 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:58:26,153 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:58:26,153 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:58:26,154 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:58:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-02 19:58:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 19:58:26,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:26,171 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:26,172 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-02 19:58:26,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:26,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:58:26,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:58:26,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,325 INFO L182 omatonBuilderFactory]: Interpolants [56#true, 57#false, 58#(= 1 (select |#valid| |main_#t~malloc5.base|)), 59#(= 1 (select |#valid| |main_#t~post6.base|))] [2018-02-02 19:58:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:58:26,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:58:26,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:58:26,335 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-02 19:58:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:26,433 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-02 19:58:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:58:26,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-02 19:58:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:26,494 INFO L225 Difference]: With dead ends: 52 [2018-02-02 19:58:26,494 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 19:58:26,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:58:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 19:58:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 19:58:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 19:58:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-02 19:58:26,518 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-02 19:58:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:26,519 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-02 19:58:26,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:58:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-02 19:58:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 19:58:26,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:26,519 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:26,519 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:26,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-02 19:58:26,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:26,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:58:26,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:58:26,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,589 INFO L182 omatonBuilderFactory]: Interpolants [163#true, 164#false, 165#(<= 128 ~n), 166#(and (= 0 |main_#t~malloc5.offset|) (<= 512 (select |#length| |main_#t~malloc5.base|))), 167#(and (<= 512 (select |#length| |main_#t~post6.base|)) (= |main_#t~post6.offset| 0))] [2018-02-02 19:58:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:58:26,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:58:26,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:58:26,590 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-02 19:58:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:26,638 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-02 19:58:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:58:26,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 19:58:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:26,639 INFO L225 Difference]: With dead ends: 48 [2018-02-02 19:58:26,639 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 19:58:26,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:58:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 19:58:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 19:58:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 19:58:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-02 19:58:26,644 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-02 19:58:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:26,644 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-02 19:58:26,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:58:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-02 19:58:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:58:26,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:26,645 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:26,645 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-02 19:58:26,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:26,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:58:26,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:58:26,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,720 INFO L182 omatonBuilderFactory]: Interpolants [272#(or (= ~a.base |main_#t~malloc5.base|) (= 1 (select |#valid| ~a.base))), 273#(or (= ~a.base |main_#t~post6.base|) (= 1 (select |#valid| ~a.base))), 268#true, 269#false, 270#(= 1 (select |#valid| |main_#t~malloc4.base|)), 271#(= 1 (select |#valid| ~a.base))] [2018-02-02 19:58:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:58:26,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:58:26,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:58:26,720 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-02 19:58:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:26,784 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-02 19:58:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:58:26,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 19:58:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:26,786 INFO L225 Difference]: With dead ends: 45 [2018-02-02 19:58:26,786 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 19:58:26,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:58:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 19:58:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 19:58:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 19:58:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-02 19:58:26,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-02 19:58:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:26,790 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-02 19:58:26,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:58:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-02 19:58:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:58:26,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:26,791 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:26,791 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-02 19:58:26,792 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:26,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:26,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:58:26,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:58:26,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:26,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-02 19:58:26,901 INFO L182 omatonBuilderFactory]: Interpolants [368#(<= 128 ~n), 369#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 370#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 371#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (select |#length| ~a.base) (* 4 ~n))), 372#(and (= foo_~i~0 0) (<= 512 (select |#length| ~a.base)) (= ~a.offset 0)), 366#true, 367#false] [2018-02-02 19:58:26,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-02 19:58:26,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:58:26,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:58:26,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:58:26,902 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-02 19:58:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:26,967 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-02 19:58:26,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:58:26,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-02 19:58:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:26,968 INFO L225 Difference]: With dead ends: 53 [2018-02-02 19:58:26,968 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 19:58:26,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:58:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 19:58:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-02 19:58:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 19:58:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-02 19:58:26,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-02 19:58:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:26,971 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-02 19:58:26,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:58:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-02 19:58:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 19:58:26,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:26,971 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:26,972 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-02 19:58:26,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:26,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:27,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 19:58:27,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,106 INFO L182 omatonBuilderFactory]: Interpolants [480#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 481#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 482#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 483#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 508) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 476#true, 477#false, 478#(<= 128 ~n), 479#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|))] [2018-02-02 19:58:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:58:27,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:58:27,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:58:27,107 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 8 states. [2018-02-02 19:58:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:27,206 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-02 19:58:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:58:27,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 19:58:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:27,209 INFO L225 Difference]: With dead ends: 65 [2018-02-02 19:58:27,209 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 19:58:27,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:58:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 19:58:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-02-02 19:58:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 19:58:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-02 19:58:27,214 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 21 [2018-02-02 19:58:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:27,214 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-02 19:58:27,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:58:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-02 19:58:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 19:58:27,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:27,215 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:27,215 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-02 19:58:27,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:27,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:27,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 19:58:27,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,439 INFO L182 omatonBuilderFactory]: Interpolants [608#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 609#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 610#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 611#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 612#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 504) (select |#length| ~a.base))), 603#true, 604#false, 605#(<= 128 ~n), 606#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 607#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-02 19:58:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:58:27,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:58:27,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:58:27,440 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 10 states. [2018-02-02 19:58:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:27,568 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-02 19:58:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:58:27,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-02 19:58:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:27,569 INFO L225 Difference]: With dead ends: 77 [2018-02-02 19:58:27,569 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 19:58:27,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:58:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 19:58:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2018-02-02 19:58:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:58:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-02 19:58:27,572 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 25 [2018-02-02 19:58:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:27,573 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-02 19:58:27,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:58:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-02 19:58:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 19:58:27,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:27,573 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:27,573 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:27,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-02 19:58:27,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:27,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:27,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 19:58:27,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,727 INFO L182 omatonBuilderFactory]: Interpolants [752#true, 753#false, 754#(<= 128 ~n), 755#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 756#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 757#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 758#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 759#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 760#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 761#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 762#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 500) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:27,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:58:27,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:58:27,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:58:27,728 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-02-02 19:58:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:27,886 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-02 19:58:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:58:27,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-02 19:58:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:27,886 INFO L225 Difference]: With dead ends: 89 [2018-02-02 19:58:27,887 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 19:58:27,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:58:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 19:58:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2018-02-02 19:58:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:58:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-02 19:58:27,889 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 29 [2018-02-02 19:58:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:27,890 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-02 19:58:27,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:58:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-02 19:58:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:58:27,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:27,890 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:27,890 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1922524849, now seen corresponding path program 4 times [2018-02-02 19:58:27,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:27,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:28,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 19:58:28,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,089 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 929#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 930#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 931#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 496) (select |#length| ~a.base))), 920#true, 921#false, 922#(<= 128 ~n), 923#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 924#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 925#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 926#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 927#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n))] [2018-02-02 19:58:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:58:28,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:58:28,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:58:28,091 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 12 states. [2018-02-02 19:58:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:28,328 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-02 19:58:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:58:28,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-02 19:58:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:28,330 INFO L225 Difference]: With dead ends: 101 [2018-02-02 19:58:28,330 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 19:58:28,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:58:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 19:58:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2018-02-02 19:58:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 19:58:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-02 19:58:28,335 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 33 [2018-02-02 19:58:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:28,335 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-02 19:58:28,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:58:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-02 19:58:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 19:58:28,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:28,336 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:28,336 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:28,336 INFO L82 PathProgramCache]: Analyzing trace with hash -165817080, now seen corresponding path program 5 times [2018-02-02 19:58:28,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:28,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:28,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 19:58:28,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,528 INFO L182 omatonBuilderFactory]: Interpolants [1107#true, 1108#false, 1109#(<= 128 ~n), 1110#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1111#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1112#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1113#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1114#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1115#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1116#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 1117#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 124) ~n)), 1118#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1119#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 492) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:58:28,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:58:28,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:58:28,529 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 13 states. [2018-02-02 19:58:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:28,737 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-02 19:58:28,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:58:28,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-02 19:58:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:28,738 INFO L225 Difference]: With dead ends: 113 [2018-02-02 19:58:28,738 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:58:28,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:58:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:58:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 68. [2018-02-02 19:58:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 19:58:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-02-02 19:58:28,742 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 37 [2018-02-02 19:58:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:28,743 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-02-02 19:58:28,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:58:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-02-02 19:58:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:58:28,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:28,744 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:28,744 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1502035935, now seen corresponding path program 6 times [2018-02-02 19:58:28,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:28,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:28,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:58:28,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,945 INFO L182 omatonBuilderFactory]: Interpolants [1313#true, 1314#false, 1315#(<= 128 ~n), 1316#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1317#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1318#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1319#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1321#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1322#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 1323#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 1324#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1325#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1326#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 488) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:28,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:58:28,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:58:28,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:58:28,945 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 14 states. [2018-02-02 19:58:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:29,231 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 19:58:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:58:29,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-02 19:58:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:29,231 INFO L225 Difference]: With dead ends: 125 [2018-02-02 19:58:29,232 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 19:58:29,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:58:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 19:58:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 72. [2018-02-02 19:58:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 19:58:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-02-02 19:58:29,236 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 41 [2018-02-02 19:58:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:29,236 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-02-02 19:58:29,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:58:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-02-02 19:58:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:58:29,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:29,238 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:29,238 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1040095434, now seen corresponding path program 7 times [2018-02-02 19:58:29,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:29,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:29,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:29,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:58:29,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:29,420 INFO L182 omatonBuilderFactory]: Interpolants [1538#true, 1539#false, 1540#(<= 128 ~n), 1541#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1542#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1543#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1544#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1545#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1546#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1547#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 1548#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 1549#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 1550#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1551#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1552#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 484) (select |#length| ~a.base)))] [2018-02-02 19:58:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:29,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:58:29,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:58:29,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:58:29,421 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 15 states. [2018-02-02 19:58:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:29,706 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-02-02 19:58:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:58:29,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 19:58:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:29,707 INFO L225 Difference]: With dead ends: 137 [2018-02-02 19:58:29,708 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 19:58:29,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:58:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 19:58:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 76. [2018-02-02 19:58:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 19:58:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-02-02 19:58:29,712 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 45 [2018-02-02 19:58:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:29,712 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-02-02 19:58:29,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:58:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-02-02 19:58:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 19:58:29,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:29,713 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:29,713 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2015753459, now seen corresponding path program 8 times [2018-02-02 19:58:29,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:29,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:29,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:29,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:58:29,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:29,989 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 1793#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 1794#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 1795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 121) ~n)), 1796#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1797#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 480) (select |#length| ~a.base))), 1782#true, 1783#false, 1784#(<= 128 ~n), 1785#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1786#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1787#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1788#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1789#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1790#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n))] [2018-02-02 19:58:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:29,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:58:29,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:58:29,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:58:29,990 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 16 states. [2018-02-02 19:58:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:30,281 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-02-02 19:58:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:58:30,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 19:58:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:30,283 INFO L225 Difference]: With dead ends: 149 [2018-02-02 19:58:30,283 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 19:58:30,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:58:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 19:58:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 80. [2018-02-02 19:58:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 19:58:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-02-02 19:58:30,285 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 49 [2018-02-02 19:58:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:30,286 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-02-02 19:58:30,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:58:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-02-02 19:58:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 19:58:30,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:30,287 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:30,287 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1501631644, now seen corresponding path program 9 times [2018-02-02 19:58:30,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:30,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:30,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:30,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 19:58:30,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:30,565 INFO L182 omatonBuilderFactory]: Interpolants [2048#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2049#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2050#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2051#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2052#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 2054#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2055#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2056#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2058#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2059#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2060#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2061#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 476) (select |#length| ~a.base))), 2045#true, 2046#false, 2047#(<= 128 ~n)] [2018-02-02 19:58:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:30,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:58:30,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:58:30,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:58:30,566 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 17 states. [2018-02-02 19:58:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:30,906 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-02 19:58:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:58:30,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 19:58:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:30,907 INFO L225 Difference]: With dead ends: 161 [2018-02-02 19:58:30,907 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 19:58:30,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:58:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 19:58:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 84. [2018-02-02 19:58:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 19:58:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-02-02 19:58:30,910 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 53 [2018-02-02 19:58:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:30,910 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-02-02 19:58:30,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:58:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-02-02 19:58:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 19:58:30,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:30,910 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:30,910 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash 746440763, now seen corresponding path program 10 times [2018-02-02 19:58:30,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:30,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:31,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:31,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:58:31,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:31,131 INFO L182 omatonBuilderFactory]: Interpolants [2336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2339#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2340#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2341#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 2342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 119) ~n)), 2343#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2344#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 472) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2327#true, 2328#false, 2329#(<= 128 ~n), 2330#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2331#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2332#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2333#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2334#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n))] [2018-02-02 19:58:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:31,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:58:31,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:58:31,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:58:31,132 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 18 states. [2018-02-02 19:58:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:31,481 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-02-02 19:58:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:58:31,481 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-02-02 19:58:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:31,482 INFO L225 Difference]: With dead ends: 173 [2018-02-02 19:58:31,482 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 19:58:31,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:58:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 19:58:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 88. [2018-02-02 19:58:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:58:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-02-02 19:58:31,486 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 57 [2018-02-02 19:58:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:31,487 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-02-02 19:58:31,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:58:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-02-02 19:58:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 19:58:31,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:31,488 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:31,488 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1417387630, now seen corresponding path program 11 times [2018-02-02 19:58:31,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:31,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:31,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:31,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 19:58:31,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:31,756 INFO L182 omatonBuilderFactory]: Interpolants [2628#true, 2629#false, 2630#(<= 128 ~n), 2631#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2632#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2633#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2634#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2635#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2636#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 2637#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2638#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2639#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2640#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2641#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2642#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 2643#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2644#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2645#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2646#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 468) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:31,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:58:31,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:58:31,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:58:31,756 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 19 states. [2018-02-02 19:58:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:32,148 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2018-02-02 19:58:32,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:58:32,148 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-02-02 19:58:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:32,149 INFO L225 Difference]: With dead ends: 185 [2018-02-02 19:58:32,149 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 19:58:32,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:58:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 19:58:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 92. [2018-02-02 19:58:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 19:58:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-02 19:58:32,153 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 61 [2018-02-02 19:58:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:32,153 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-02 19:58:32,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:58:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-02 19:58:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 19:58:32,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:32,154 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:32,154 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1470072983, now seen corresponding path program 12 times [2018-02-02 19:58:32,155 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:32,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:32,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:32,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 19:58:32,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:32,471 INFO L182 omatonBuilderFactory]: Interpolants [2948#true, 2949#false, 2950#(<= 128 ~n), 2951#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2952#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2953#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2954#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2955#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2956#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 2957#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2958#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2959#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2960#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2961#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 2963#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2964#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2965#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2966#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2967#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 464) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:32,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:58:32,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:58:32,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:58:32,472 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 20 states. [2018-02-02 19:58:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:32,876 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-02 19:58:32,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:58:32,876 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-02 19:58:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:32,877 INFO L225 Difference]: With dead ends: 197 [2018-02-02 19:58:32,877 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 19:58:32,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=726, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:58:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 19:58:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 96. [2018-02-02 19:58:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:58:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-02-02 19:58:32,880 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 65 [2018-02-02 19:58:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:32,880 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-02-02 19:58:32,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:58:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-02-02 19:58:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 19:58:32,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:32,881 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:32,881 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 184535488, now seen corresponding path program 13 times [2018-02-02 19:58:32,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:32,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:33,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:33,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 19:58:33,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:33,216 INFO L182 omatonBuilderFactory]: Interpolants [3296#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 3297#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 3298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 3299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 3300#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 3302#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3303#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3304#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3305#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3306#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3307#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 460) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3287#true, 3288#false, 3289#(<= 128 ~n), 3290#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 3291#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3292#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3293#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3294#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 3295#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n))] [2018-02-02 19:58:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:33,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:58:33,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:58:33,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:58:33,217 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 21 states. [2018-02-02 19:58:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:33,655 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2018-02-02 19:58:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:58:33,655 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-02-02 19:58:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:33,656 INFO L225 Difference]: With dead ends: 209 [2018-02-02 19:58:33,656 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 19:58:33,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:58:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 19:58:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 100. [2018-02-02 19:58:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 19:58:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-02 19:58:33,659 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 69 [2018-02-02 19:58:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:33,659 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-02 19:58:33,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:58:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-02 19:58:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 19:58:33,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:33,660 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:33,660 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1905256297, now seen corresponding path program 14 times [2018-02-02 19:58:33,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:33,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:34,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:34,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 19:58:34,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:34,037 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 3649#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3650#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3651#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3652#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 3653#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 3654#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 3655#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 3656#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 3657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 3658#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 3660#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3661#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3662#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3663#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3664#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3665#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3666#(and (<= (+ (* 4 foo_~i~0) 456) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3645#true, 3646#false, 3647#(<= 128 ~n)] [2018-02-02 19:58:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:34,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:58:34,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:58:34,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:58:34,038 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 22 states. [2018-02-02 19:58:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:34,494 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-02-02 19:58:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:58:34,495 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-02 19:58:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:34,495 INFO L225 Difference]: With dead ends: 221 [2018-02-02 19:58:34,495 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 19:58:34,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=909, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:58:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 19:58:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 104. [2018-02-02 19:58:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 19:58:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-02-02 19:58:34,498 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 73 [2018-02-02 19:58:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:34,498 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-02-02 19:58:34,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:58:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-02-02 19:58:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 19:58:34,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:34,498 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:34,498 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash 819930094, now seen corresponding path program 15 times [2018-02-02 19:58:34,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:34,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:34,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:34,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 19:58:34,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:34,844 INFO L182 omatonBuilderFactory]: Interpolants [4032#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 4033#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 4034#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 4035#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 4037#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4038#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4039#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4040#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4041#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4042#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4043#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4044#(and (<= (+ (* 4 foo_~i~0) 452) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4022#true, 4023#false, 4024#(<= 128 ~n), 4025#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4026#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4027#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4028#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4029#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 4030#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 4031#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n))] [2018-02-02 19:58:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:34,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:58:34,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:58:34,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:58:34,845 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 23 states. [2018-02-02 19:58:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:35,418 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2018-02-02 19:58:35,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:58:35,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2018-02-02 19:58:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:35,420 INFO L225 Difference]: With dead ends: 233 [2018-02-02 19:58:35,420 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 19:58:35,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=474, Invalid=1008, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 19:58:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 19:58:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 108. [2018-02-02 19:58:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 19:58:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-02 19:58:35,424 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 77 [2018-02-02 19:58:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:35,424 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-02 19:58:35,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:58:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-02 19:58:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:58:35,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:35,425 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:35,425 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1550144571, now seen corresponding path program 16 times [2018-02-02 19:58:35,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:35,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:35,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:35,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 19:58:35,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:35,900 INFO L182 omatonBuilderFactory]: Interpolants [4418#true, 4419#false, 4420#(<= 128 ~n), 4421#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4422#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4423#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4424#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4425#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 4426#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 4427#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 4428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 4429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 4430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 4431#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 4433#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4434#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4435#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4436#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4437#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4438#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4439#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4440#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4441#(and (<= (+ (* 4 foo_~i~0) 448) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:35,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:58:35,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:58:35,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:58:35,901 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 24 states. [2018-02-02 19:58:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:36,490 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions. [2018-02-02 19:58:36,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:58:36,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-02-02 19:58:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:36,491 INFO L225 Difference]: With dead ends: 245 [2018-02-02 19:58:36,491 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 19:58:36,491 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=1112, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:58:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 19:58:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 112. [2018-02-02 19:58:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 19:58:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-02-02 19:58:36,493 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 81 [2018-02-02 19:58:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:36,494 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-02-02 19:58:36,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:58:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-02-02 19:58:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 19:58:36,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:36,494 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:36,494 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:36,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1156550628, now seen corresponding path program 17 times [2018-02-02 19:58:36,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:36,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:36,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:36,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 19:58:36,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:36,886 INFO L182 omatonBuilderFactory]: Interpolants [4833#true, 4834#false, 4835#(<= 128 ~n), 4836#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4837#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4838#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4839#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4840#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 4841#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 4842#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 4843#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 4844#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 4845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 4846#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 4848#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4849#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4850#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4851#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4852#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4853#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4854#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 4855#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4856#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4857#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 444) (select |#length| ~a.base)))] [2018-02-02 19:58:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:36,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:58:36,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:58:36,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:58:36,887 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2018-02-02 19:58:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:37,535 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2018-02-02 19:58:37,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:58:37,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-02-02 19:58:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:37,537 INFO L225 Difference]: With dead ends: 257 [2018-02-02 19:58:37,537 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 19:58:37,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=585, Invalid=1221, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:58:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 19:58:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 116. [2018-02-02 19:58:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:58:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-02-02 19:58:37,541 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 85 [2018-02-02 19:58:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:37,542 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-02-02 19:58:37,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:58:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-02-02 19:58:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 19:58:37,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:37,543 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:37,543 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash -556912397, now seen corresponding path program 18 times [2018-02-02 19:58:37,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:37,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:38,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:38,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:58:38,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:38,018 INFO L182 omatonBuilderFactory]: Interpolants [5267#true, 5268#false, 5269#(<= 128 ~n), 5270#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5271#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5272#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5273#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5274#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 5275#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 5276#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 5277#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 5278#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 5279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 5280#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5281#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 5282#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5283#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5284#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5285#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5286#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5287#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5288#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 5289#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 5290#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5291#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5292#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 440) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:38,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:58:38,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:58:38,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:58:38,018 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 26 states. [2018-02-02 19:58:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:38,660 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2018-02-02 19:58:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:58:38,661 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-02-02 19:58:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:38,662 INFO L225 Difference]: With dead ends: 269 [2018-02-02 19:58:38,662 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 19:58:38,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=645, Invalid=1335, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 19:58:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 19:58:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 120. [2018-02-02 19:58:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 19:58:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-02-02 19:58:38,665 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 89 [2018-02-02 19:58:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:38,665 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-02-02 19:58:38,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:58:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-02-02 19:58:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 19:58:38,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:38,665 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:38,665 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2038541898, now seen corresponding path program 19 times [2018-02-02 19:58:38,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:38,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:39,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:39,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 19:58:39,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:39,095 INFO L182 omatonBuilderFactory]: Interpolants [5720#true, 5721#false, 5722#(<= 128 ~n), 5723#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5724#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5725#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5726#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5727#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 5728#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 5729#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 5730#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 5731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 5732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 5733#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 5735#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5736#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5737#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5738#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5739#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5740#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5741#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 5742#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 5743#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 5744#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5745#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5746#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 436) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:39,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:58:39,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:58:39,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=473, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:58:39,096 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 27 states. [2018-02-02 19:58:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:39,918 INFO L93 Difference]: Finished difference Result 281 states and 302 transitions. [2018-02-02 19:58:39,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:58:39,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2018-02-02 19:58:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:39,919 INFO L225 Difference]: With dead ends: 281 [2018-02-02 19:58:39,919 INFO L226 Difference]: Without dead ends: 281 [2018-02-02 19:58:39,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:58:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-02 19:58:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 124. [2018-02-02 19:58:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 19:58:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-02-02 19:58:39,923 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 93 [2018-02-02 19:58:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:39,924 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-02-02 19:58:39,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:58:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-02-02 19:58:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 19:58:39,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:39,925 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:39,925 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1761126433, now seen corresponding path program 20 times [2018-02-02 19:58:39,925 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:39,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:40,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:40,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 19:58:40,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:40,533 INFO L182 omatonBuilderFactory]: Interpolants [6208#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6209#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6210#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6211#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6212#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 6214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 6215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 6216#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6217#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6219#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 432) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6192#true, 6193#false, 6194#(<= 128 ~n), 6195#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 6196#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6197#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6198#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 6200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 6201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 6202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 6203#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 6204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 6205#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 6207#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-02 19:58:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:40,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:58:40,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:58:40,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=506, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:58:40,533 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 28 states. [2018-02-02 19:58:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:41,207 INFO L93 Difference]: Finished difference Result 293 states and 315 transitions. [2018-02-02 19:58:41,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:58:41,207 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-02-02 19:58:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:41,208 INFO L225 Difference]: With dead ends: 293 [2018-02-02 19:58:41,208 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 19:58:41,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=774, Invalid=1578, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:58:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 19:58:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 128. [2018-02-02 19:58:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 19:58:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-02-02 19:58:41,210 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 97 [2018-02-02 19:58:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:41,210 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-02-02 19:58:41,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:58:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-02-02 19:58:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 19:58:41,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:41,211 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:41,211 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1847647864, now seen corresponding path program 21 times [2018-02-02 19:58:41,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:41,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:41,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:41,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 19:58:41,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:41,761 INFO L182 omatonBuilderFactory]: Interpolants [6683#true, 6684#false, 6685#(<= 128 ~n), 6686#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 6687#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6688#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6689#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6690#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 6691#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 6692#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 6693#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 6694#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 6695#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 6696#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6697#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 6698#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6699#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6700#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6701#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6702#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6703#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6704#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 6705#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 6706#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 6707#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6708#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 6709#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6710#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6711#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 428) (select |#length| ~a.base)))] [2018-02-02 19:58:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:41,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 19:58:41,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 19:58:41,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=540, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:58:41,762 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 29 states. [2018-02-02 19:58:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:42,563 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-02-02 19:58:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:58:42,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2018-02-02 19:58:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:42,564 INFO L225 Difference]: With dead ends: 305 [2018-02-02 19:58:42,564 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 19:58:42,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 19:58:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 19:58:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 132. [2018-02-02 19:58:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 19:58:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-02-02 19:58:42,568 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 101 [2018-02-02 19:58:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:42,568 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-02-02 19:58:42,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 19:58:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-02-02 19:58:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 19:58:42,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:42,569 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:42,569 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1660415665, now seen corresponding path program 22 times [2018-02-02 19:58:42,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:42,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:43,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:43,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 19:58:43,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:43,186 INFO L182 omatonBuilderFactory]: Interpolants [7193#true, 7194#false, 7195#(<= 128 ~n), 7196#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 7197#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7198#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7199#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 7201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 7202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 7203#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 7204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 7205#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 7206#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 7208#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7209#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7210#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7211#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7212#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7213#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 7215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 7216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 7217#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 7219#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7220#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 7221#(and (<= (+ foo_~i~0 106) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7222#(and (<= (+ (* 4 foo_~i~0) 424) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:43,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:58:43,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:58:43,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=575, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:58:43,187 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 30 states. [2018-02-02 19:58:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:43,995 INFO L93 Difference]: Finished difference Result 317 states and 341 transitions. [2018-02-02 19:58:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 19:58:43,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 105 [2018-02-02 19:58:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:43,996 INFO L225 Difference]: With dead ends: 317 [2018-02-02 19:58:43,996 INFO L226 Difference]: Without dead ends: 317 [2018-02-02 19:58:43,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=915, Invalid=1841, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 19:58:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-02 19:58:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 136. [2018-02-02 19:58:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:58:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-02-02 19:58:43,999 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 105 [2018-02-02 19:58:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:43,999 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-02-02 19:58:43,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:58:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-02-02 19:58:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 19:58:43,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:43,999 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:43,999 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash -857997146, now seen corresponding path program 23 times [2018-02-02 19:58:44,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:44,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:44,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:44,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 19:58:44,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:44,645 INFO L182 omatonBuilderFactory]: Interpolants [7744#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 7745#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 7746#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7747#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 7748#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7749#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7750#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 7751#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7752#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 420) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7722#true, 7723#false, 7724#(<= 128 ~n), 7725#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 7726#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7727#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7728#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7729#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 7730#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 7731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 7732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 7733#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 7734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 7735#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7736#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 7737#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7738#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7739#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7740#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7741#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7742#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7743#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n))] [2018-02-02 19:58:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:44,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:58:44,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:58:44,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=611, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:58:44,646 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 31 states. [2018-02-02 19:58:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:45,376 INFO L93 Difference]: Finished difference Result 329 states and 354 transitions. [2018-02-02 19:58:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:58:45,376 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-02-02 19:58:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:45,377 INFO L225 Difference]: With dead ends: 329 [2018-02-02 19:58:45,377 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 19:58:45,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=1980, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:58:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 19:58:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 140. [2018-02-02 19:58:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 19:58:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-02 19:58:45,379 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 109 [2018-02-02 19:58:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:45,380 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-02 19:58:45,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:58:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-02 19:58:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 19:58:45,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:45,380 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:45,380 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 132803709, now seen corresponding path program 24 times [2018-02-02 19:58:45,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:45,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:45,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:45,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 19:58:45,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:45,911 INFO L182 omatonBuilderFactory]: Interpolants [8270#true, 8271#false, 8272#(<= 128 ~n), 8273#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 8274#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8275#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8276#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8277#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 8278#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 8279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 8280#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 8281#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 8282#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 8283#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8284#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 8285#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8286#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8287#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8288#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8289#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8290#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8291#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 8292#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 8293#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 8294#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8295#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 8296#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8297#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 8299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8301#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 416) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:45,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 19:58:45,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 19:58:45,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=648, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:58:45,912 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 32 states. [2018-02-02 19:58:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:46,783 INFO L93 Difference]: Finished difference Result 341 states and 367 transitions. [2018-02-02 19:58:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:58:46,784 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2018-02-02 19:58:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:46,785 INFO L225 Difference]: With dead ends: 341 [2018-02-02 19:58:46,785 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 19:58:46,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1068, Invalid=2124, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 19:58:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 19:58:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 144. [2018-02-02 19:58:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 19:58:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-02-02 19:58:46,790 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 113 [2018-02-02 19:58:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:46,790 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-02-02 19:58:46,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 19:58:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-02-02 19:58:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 19:58:46,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:46,791 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:46,791 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:46,791 INFO L82 PathProgramCache]: Analyzing trace with hash -73329452, now seen corresponding path program 25 times [2018-02-02 19:58:46,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:46,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:47,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:47,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 19:58:47,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:47,428 INFO L182 omatonBuilderFactory]: Interpolants [8837#true, 8838#false, 8839#(<= 128 ~n), 8840#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 8841#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8842#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8843#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8844#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 8845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 8846#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 8847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 8848#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 8849#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 8850#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8851#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 8852#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8853#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8854#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8855#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8856#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8857#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8858#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 8859#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 8860#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 8861#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8862#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 8863#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8864#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8865#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 8866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 8867#(and (= ~a.offset 0) (<= (+ foo_~i~0 104) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8868#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8869#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 412) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:47,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:58:47,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:58:47,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=686, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:58:47,429 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 33 states. [2018-02-02 19:58:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:48,383 INFO L93 Difference]: Finished difference Result 353 states and 380 transitions. [2018-02-02 19:58:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 19:58:48,383 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-02-02 19:58:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:48,384 INFO L225 Difference]: With dead ends: 353 [2018-02-02 19:58:48,384 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 19:58:48,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1149, Invalid=2273, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 19:58:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 19:58:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 148. [2018-02-02 19:58:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 19:58:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-02-02 19:58:48,388 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 117 [2018-02-02 19:58:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:48,388 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-02-02 19:58:48,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:58:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-02-02 19:58:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 19:58:48,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:48,389 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:48,389 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1754118571, now seen corresponding path program 26 times [2018-02-02 19:58:48,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:48,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:49,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:49,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 19:58:49,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:49,096 INFO L182 omatonBuilderFactory]: Interpolants [9423#true, 9424#false, 9425#(<= 128 ~n), 9426#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 9427#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9428#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9429#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 9431#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 9432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 9433#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 9434#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 9435#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 9436#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9437#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 9438#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9439#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9440#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9441#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9442#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9443#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9444#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 9445#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 9446#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 9447#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 9449#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9450#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 9452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 9453#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9454#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 9455#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 9456#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 408) (select |#length| ~a.base)))] [2018-02-02 19:58:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:49,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:58:49,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:58:49,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=725, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:58:49,097 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 34 states. [2018-02-02 19:58:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:50,082 INFO L93 Difference]: Finished difference Result 365 states and 393 transitions. [2018-02-02 19:58:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:58:50,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 121 [2018-02-02 19:58:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:50,083 INFO L225 Difference]: With dead ends: 365 [2018-02-02 19:58:50,083 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 19:58:50,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1233, Invalid=2427, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 19:58:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 19:58:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 152. [2018-02-02 19:58:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 19:58:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-02-02 19:58:50,088 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 121 [2018-02-02 19:58:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:50,088 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-02-02 19:58:50,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:58:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-02-02 19:58:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-02 19:58:50,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:50,089 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:50,089 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1839326462, now seen corresponding path program 27 times [2018-02-02 19:58:50,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:50,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:50,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:50,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 19:58:50,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:50,943 INFO L182 omatonBuilderFactory]: Interpolants [10048#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10049#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 10050#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 10051#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 10052#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 10054#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10055#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10056#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 10057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 10058#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10059#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10060#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 10061#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10062#(and (<= (+ (* 4 foo_~i~0) 404) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10028#true, 10029#false, 10030#(<= 128 ~n), 10031#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 10032#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10033#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10034#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10035#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 10036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 10037#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 10038#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 10039#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 10040#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 10041#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10042#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 10043#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10044#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10045#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10046#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10047#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-02 19:58:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:50,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:58:50,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:58:50,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=765, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:58:50,944 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 35 states. [2018-02-02 19:58:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:51,862 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2018-02-02 19:58:51,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:58:51,863 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 125 [2018-02-02 19:58:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:51,863 INFO L225 Difference]: With dead ends: 377 [2018-02-02 19:58:51,864 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 19:58:51,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1320, Invalid=2586, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 19:58:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 19:58:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 156. [2018-02-02 19:58:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 19:58:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-02-02 19:58:51,866 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 125 [2018-02-02 19:58:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:51,867 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-02-02 19:58:51,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:58:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-02-02 19:58:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 19:58:51,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:51,867 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:51,867 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1344276263, now seen corresponding path program 28 times [2018-02-02 19:58:51,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:51,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:52,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:52,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 19:58:52,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:52,603 INFO L182 omatonBuilderFactory]: Interpolants [10652#true, 10653#false, 10654#(<= 128 ~n), 10655#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 10656#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10657#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10658#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 10660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 10661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 10662#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 10663#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 10664#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 10665#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 10667#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10668#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10669#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10670#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10671#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10672#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 10674#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 10675#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 10676#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10677#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 10678#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10679#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10680#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 10681#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 10682#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10683#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10684#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10685#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 10686#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 100) ~n)), 10687#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 400) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:58:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:52,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:58:52,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:58:52,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:58:52,604 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 36 states. [2018-02-02 19:58:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:53,683 INFO L93 Difference]: Finished difference Result 389 states and 419 transitions. [2018-02-02 19:58:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 19:58:53,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 129 [2018-02-02 19:58:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:53,684 INFO L225 Difference]: With dead ends: 389 [2018-02-02 19:58:53,684 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 19:58:53,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1410, Invalid=2750, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 19:58:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 19:58:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 160. [2018-02-02 19:58:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 19:58:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-02-02 19:58:53,687 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 129 [2018-02-02 19:58:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:53,688 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-02-02 19:58:53,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:58:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-02-02 19:58:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 19:58:53,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:53,688 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:53,688 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1526797104, now seen corresponding path program 29 times [2018-02-02 19:58:53,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:53,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:54,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:54,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 19:58:54,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:54,488 INFO L182 omatonBuilderFactory]: Interpolants [11328#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 11329#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 100) ~n)), 11330#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11331#(and (<= (+ (* 4 foo_~i~0) 396) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11295#true, 11296#false, 11297#(<= 128 ~n), 11298#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 11299#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11300#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11301#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 11303#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 11304#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 11305#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 11306#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 11307#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 11308#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11309#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 11310#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11311#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11312#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11313#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11314#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11315#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11316#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 11317#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 11318#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 11319#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 11321#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11322#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11323#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 11324#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 11325#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11326#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11327#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-02 19:58:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:54,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 19:58:54,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 19:58:54,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=848, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:58:54,489 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 37 states. [2018-02-02 19:58:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:55,503 INFO L93 Difference]: Finished difference Result 401 states and 432 transitions. [2018-02-02 19:58:55,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 19:58:55,503 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2018-02-02 19:58:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:55,504 INFO L225 Difference]: With dead ends: 401 [2018-02-02 19:58:55,504 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 19:58:55,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1503, Invalid=2919, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 19:58:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 19:58:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 164. [2018-02-02 19:58:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 19:58:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-02-02 19:58:55,508 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 133 [2018-02-02 19:58:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:55,508 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-02-02 19:58:55,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 19:58:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-02-02 19:58:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 19:58:55,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:55,509 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:55,509 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 13576711, now seen corresponding path program 30 times [2018-02-02 19:58:55,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:55,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:56,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:56,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 19:58:56,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:56,375 INFO L182 omatonBuilderFactory]: Interpolants [11968#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 11969#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 11970#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11971#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 11972#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11973#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11974#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11975#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11976#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11977#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11978#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 11979#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 11980#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 11981#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11982#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 11983#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11984#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11985#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 11986#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 11987#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11988#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11989#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11990#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 11991#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 11992#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 11993#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11994#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 392) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11957#true, 11958#false, 11959#(<= 128 ~n), 11960#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 11961#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11962#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11963#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11964#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 11965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 11966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 11967#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n))] [2018-02-02 19:58:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:56,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 19:58:56,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 19:58:56,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:58:56,376 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 38 states. [2018-02-02 19:58:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:57,486 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2018-02-02 19:58:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 19:58:57,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 137 [2018-02-02 19:58:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:57,488 INFO L225 Difference]: With dead ends: 413 [2018-02-02 19:58:57,488 INFO L226 Difference]: Without dead ends: 413 [2018-02-02 19:58:57,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1599, Invalid=3093, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 19:58:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-02 19:58:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 168. [2018-02-02 19:58:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 19:58:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-02-02 19:58:57,490 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 137 [2018-02-02 19:58:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:57,490 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-02-02 19:58:57,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 19:58:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-02-02 19:58:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 19:58:57,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:57,491 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:57,491 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:57,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1366818142, now seen corresponding path program 31 times [2018-02-02 19:58:57,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:57,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:58:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:58,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:58:58,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 19:58:58,295 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:58:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:58,295 INFO L182 omatonBuilderFactory]: Interpolants [12672#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 12673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 12674#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 98) ~n)), 12675#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 12676#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 388) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 12638#true, 12639#false, 12640#(<= 128 ~n), 12641#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 12642#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12643#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12644#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12645#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 12646#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 12647#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 12648#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 12649#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 12650#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 12651#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12652#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 12653#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12654#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12655#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12656#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12657#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12658#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 12660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 12661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 12662#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12663#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 12664#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12665#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 12667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 12668#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12669#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12670#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12671#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n))] [2018-02-02 19:58:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:58:58,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 19:58:58,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 19:58:58,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=935, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 19:58:58,296 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 39 states. [2018-02-02 19:58:59,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:58:59,472 INFO L93 Difference]: Finished difference Result 425 states and 458 transitions. [2018-02-02 19:58:59,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:58:59,472 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 141 [2018-02-02 19:58:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:58:59,473 INFO L225 Difference]: With dead ends: 425 [2018-02-02 19:58:59,473 INFO L226 Difference]: Without dead ends: 425 [2018-02-02 19:58:59,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1698, Invalid=3272, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 19:58:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-02 19:58:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 172. [2018-02-02 19:58:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 19:58:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-02-02 19:58:59,475 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 141 [2018-02-02 19:58:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:58:59,475 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-02-02 19:58:59,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 19:58:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-02-02 19:58:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-02 19:58:59,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:58:59,476 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:58:59,476 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:58:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1337373387, now seen corresponding path program 32 times [2018-02-02 19:58:59,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:58:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:58:59,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:00,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:00,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 19:59:00,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:00,375 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 13377#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 384) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 13338#true, 13339#false, 13340#(<= 128 ~n), 13341#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 13342#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13343#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13344#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13345#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 13346#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 13347#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 13348#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 13349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 13350#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 13351#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13352#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 13353#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13354#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13355#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13356#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13357#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13358#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13359#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 13360#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 13361#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 13362#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 13364#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13365#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13366#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 13367#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 13368#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13369#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13370#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13371#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 13372#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 13373#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 13374#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13375#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:00,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 19:59:00,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 19:59:00,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=980, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:59:00,376 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 40 states. [2018-02-02 19:59:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:01,735 INFO L93 Difference]: Finished difference Result 437 states and 471 transitions. [2018-02-02 19:59:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 19:59:01,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 145 [2018-02-02 19:59:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:01,737 INFO L225 Difference]: With dead ends: 437 [2018-02-02 19:59:01,737 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 19:59:01,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1800, Invalid=3456, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 19:59:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 19:59:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 176. [2018-02-02 19:59:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 19:59:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-02-02 19:59:01,741 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 145 [2018-02-02 19:59:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:01,741 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-02-02 19:59:01,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 19:59:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-02-02 19:59:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-02 19:59:01,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:01,742 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:01,742 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1548691060, now seen corresponding path program 33 times [2018-02-02 19:59:01,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:01,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:02,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:02,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 19:59:02,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:02,926 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 14081#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14082#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 14083#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14084#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14085#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 14086#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 14087#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14088#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14089#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14090#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 14091#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 14092#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 14093#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14094#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14095#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 14096#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14097#(and (<= (+ (* 4 foo_~i~0) 380) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14057#true, 14058#false, 14059#(<= 128 ~n), 14060#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 14061#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14062#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14063#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14064#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 14065#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 14066#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 14067#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 14068#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 14069#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 14070#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14071#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 14072#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14073#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14074#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14075#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14076#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14077#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14078#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 14079#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n))] [2018-02-02 19:59:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:02,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:59:02,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:59:02,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1026, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:59:02,927 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 41 states. [2018-02-02 19:59:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:04,350 INFO L93 Difference]: Finished difference Result 449 states and 484 transitions. [2018-02-02 19:59:04,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 19:59:04,350 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 149 [2018-02-02 19:59:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:04,351 INFO L225 Difference]: With dead ends: 449 [2018-02-02 19:59:04,351 INFO L226 Difference]: Without dead ends: 449 [2018-02-02 19:59:04,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1905, Invalid=3645, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 19:59:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-02 19:59:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 180. [2018-02-02 19:59:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 19:59:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-02-02 19:59:04,354 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 149 [2018-02-02 19:59:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:04,354 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-02-02 19:59:04,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:59:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-02-02 19:59:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-02 19:59:04,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:04,355 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:04,355 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585251, now seen corresponding path program 34 times [2018-02-02 19:59:04,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:04,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:05,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:05,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 19:59:05,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:05,432 INFO L182 omatonBuilderFactory]: Interpolants [14795#true, 14796#false, 14797#(<= 128 ~n), 14798#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 14799#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14800#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14801#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14802#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 14803#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 14804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 14805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 14806#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 14807#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 14808#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14809#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 14810#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14811#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14812#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14813#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14814#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14815#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 14817#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 14818#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 14819#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 14821#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14822#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14823#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 14824#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 14825#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14826#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14827#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14828#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 14829#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 14830#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 14831#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14832#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14833#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14834#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 14835#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14836#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 376) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:05,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:59:05,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:59:05,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1073, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:59:05,433 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 42 states. [2018-02-02 19:59:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:06,784 INFO L93 Difference]: Finished difference Result 461 states and 497 transitions. [2018-02-02 19:59:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 19:59:06,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 153 [2018-02-02 19:59:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:06,786 INFO L225 Difference]: With dead ends: 461 [2018-02-02 19:59:06,786 INFO L226 Difference]: Without dead ends: 461 [2018-02-02 19:59:06,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2013, Invalid=3839, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 19:59:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-02 19:59:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 184. [2018-02-02 19:59:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 19:59:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-02-02 19:59:06,790 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 153 [2018-02-02 19:59:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:06,790 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-02-02 19:59:06,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:59:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-02-02 19:59:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 19:59:06,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:06,791 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:06,791 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1315330118, now seen corresponding path program 35 times [2018-02-02 19:59:06,792 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:06,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:07,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:07,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 19:59:07,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:07,806 INFO L182 omatonBuilderFactory]: Interpolants [15552#true, 15553#false, 15554#(<= 128 ~n), 15555#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 15556#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15557#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15558#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15559#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 15560#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 15561#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 15562#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 15563#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 15564#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 15565#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15566#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 15567#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15568#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15569#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15570#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15571#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15572#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15573#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 15574#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 15575#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 15576#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15577#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 15578#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15579#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15580#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 15581#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 15582#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15583#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15584#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15585#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 15586#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 15587#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 15588#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15589#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15590#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15591#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 15592#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 15593#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 15594#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 372) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:07,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 19:59:07,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 19:59:07,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=1121, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:59:07,806 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 43 states. [2018-02-02 19:59:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:09,256 INFO L93 Difference]: Finished difference Result 473 states and 510 transitions. [2018-02-02 19:59:09,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 19:59:09,257 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2018-02-02 19:59:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:09,258 INFO L225 Difference]: With dead ends: 473 [2018-02-02 19:59:09,258 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 19:59:09,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2124, Invalid=4038, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 19:59:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 19:59:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 188. [2018-02-02 19:59:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 19:59:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-02 19:59:09,261 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 157 [2018-02-02 19:59:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:09,261 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-02 19:59:09,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 19:59:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-02 19:59:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-02 19:59:09,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:09,262 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:09,262 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2023123345, now seen corresponding path program 36 times [2018-02-02 19:59:09,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:09,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:10,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:10,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 19:59:10,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:10,386 INFO L182 omatonBuilderFactory]: Interpolants [16328#true, 16329#false, 16330#(<= 128 ~n), 16331#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 16332#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16333#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16334#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 16336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 16337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 16338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 16339#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 16340#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 16341#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 16343#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16344#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16345#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16346#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16347#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16348#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 16350#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 16351#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 16352#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16353#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 16354#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16355#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16356#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 16357#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 16358#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16359#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16360#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16361#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 16362#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 16363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 16364#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16365#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16366#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16367#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 16368#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16369#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 16370#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 16371#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 368) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:10,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 19:59:10,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 19:59:10,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1170, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 19:59:10,387 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 44 states. [2018-02-02 19:59:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:11,851 INFO L93 Difference]: Finished difference Result 485 states and 523 transitions. [2018-02-02 19:59:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 19:59:11,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 161 [2018-02-02 19:59:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:11,876 INFO L225 Difference]: With dead ends: 485 [2018-02-02 19:59:11,876 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 19:59:11,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2238, Invalid=4242, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 19:59:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 19:59:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 192. [2018-02-02 19:59:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 19:59:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-02-02 19:59:11,879 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 161 [2018-02-02 19:59:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:11,880 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-02-02 19:59:11,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 19:59:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-02-02 19:59:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-02 19:59:11,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:11,881 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:11,881 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:11,881 INFO L82 PathProgramCache]: Analyzing trace with hash 220227560, now seen corresponding path program 37 times [2018-02-02 19:59:11,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:11,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:12,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:12,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 19:59:12,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:12,940 INFO L182 omatonBuilderFactory]: Interpolants [17152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 17153#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17154#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17155#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 17157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 17158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 17159#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17160#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17161#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 17163#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17164#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17165#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 17166#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17167#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 364) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17123#true, 17124#false, 17125#(<= 128 ~n), 17126#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 17127#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17128#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17129#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 17131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 17132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 17133#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 17134#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 17135#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 17136#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17137#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 17138#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17139#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17140#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17141#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17142#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17143#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17144#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 17145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 17146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 17147#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17148#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 17149#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17150#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n))] [2018-02-02 19:59:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:12,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 19:59:12,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 19:59:12,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=1220, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 19:59:12,941 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 45 states. [2018-02-02 19:59:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:14,475 INFO L93 Difference]: Finished difference Result 497 states and 536 transitions. [2018-02-02 19:59:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 19:59:14,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 165 [2018-02-02 19:59:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:14,477 INFO L225 Difference]: With dead ends: 497 [2018-02-02 19:59:14,477 INFO L226 Difference]: Without dead ends: 497 [2018-02-02 19:59:14,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2355, Invalid=4451, Unknown=0, NotChecked=0, Total=6806 [2018-02-02 19:59:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-02 19:59:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 196. [2018-02-02 19:59:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 19:59:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-02-02 19:59:14,481 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 165 [2018-02-02 19:59:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:14,482 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-02-02 19:59:14,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 19:59:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-02-02 19:59:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 19:59:14,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:14,483 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:14,483 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 893739711, now seen corresponding path program 38 times [2018-02-02 19:59:14,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:14,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:15,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:15,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 19:59:15,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:15,544 INFO L182 omatonBuilderFactory]: Interpolants [17937#true, 17938#false, 17939#(<= 128 ~n), 17940#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 17941#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17942#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17943#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17944#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 17945#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 17946#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 17947#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 17948#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 17949#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 17950#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17951#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 17952#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17953#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17954#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17955#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17956#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17957#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17958#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 17959#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 17960#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 17961#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 17963#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17964#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 17966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 17967#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17968#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17969#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17970#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 17971#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 17972#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 17973#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17974#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17975#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17976#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 17977#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17978#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17979#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17980#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 17981#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17982#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 360) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:15,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 19:59:15,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 19:59:15,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=1271, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:59:15,545 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 46 states. [2018-02-02 19:59:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:17,150 INFO L93 Difference]: Finished difference Result 509 states and 549 transitions. [2018-02-02 19:59:17,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 19:59:17,176 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 169 [2018-02-02 19:59:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:17,177 INFO L225 Difference]: With dead ends: 509 [2018-02-02 19:59:17,177 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 19:59:17,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2475, Invalid=4665, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 19:59:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 19:59:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 200. [2018-02-02 19:59:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 19:59:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-02-02 19:59:17,180 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 169 [2018-02-02 19:59:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:17,180 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-02-02 19:59:17,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 19:59:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-02-02 19:59:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-02 19:59:17,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:17,181 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:17,181 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2050169366, now seen corresponding path program 39 times [2018-02-02 19:59:17,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:17,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:18,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:18,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 19:59:18,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:18,374 INFO L182 omatonBuilderFactory]: Interpolants [18816#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 356) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 18770#true, 18771#false, 18772#(<= 128 ~n), 18773#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 18774#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18775#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18776#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18777#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 18778#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 18779#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 18780#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 18781#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 18782#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 18783#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18784#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 18785#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18786#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18787#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18788#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18789#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18790#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 18792#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 18793#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 18794#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 18796#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18797#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18798#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 18799#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 18800#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18801#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18802#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18803#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 18804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 18805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 18806#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18807#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18808#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18809#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 18810#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18811#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18812#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18813#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 18814#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 18815#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:18,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 19:59:18,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 19:59:18,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=1323, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:59:18,375 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 47 states. [2018-02-02 19:59:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:20,060 INFO L93 Difference]: Finished difference Result 521 states and 562 transitions. [2018-02-02 19:59:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 19:59:20,060 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 173 [2018-02-02 19:59:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:20,061 INFO L225 Difference]: With dead ends: 521 [2018-02-02 19:59:20,061 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 19:59:20,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2598, Invalid=4884, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 19:59:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 19:59:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 204. [2018-02-02 19:59:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 19:59:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-02-02 19:59:20,065 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 173 [2018-02-02 19:59:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:20,066 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-02-02 19:59:20,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 19:59:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-02-02 19:59:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 19:59:20,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:20,067 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:20,067 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1741206035, now seen corresponding path program 40 times [2018-02-02 19:59:20,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:20,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:21,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:21,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 19:59:21,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:21,225 INFO L182 omatonBuilderFactory]: Interpolants [19648#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19649#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19650#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 19651#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 19652#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19653#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19654#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19655#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 19656#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 19657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 19658#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19659#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19660#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 19662#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19663#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19664#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19665#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 19666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 19667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 19668#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 19669#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 352) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 19622#true, 19623#false, 19624#(<= 128 ~n), 19625#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 19626#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19627#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19628#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19629#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 19630#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 19631#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 19632#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 19633#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 19634#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 19635#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19636#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 19637#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19638#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19639#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19640#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19641#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19642#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19643#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 19644#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 19645#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 19646#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19647#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n))] [2018-02-02 19:59:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:21,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 19:59:21,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 19:59:21,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=880, Invalid=1376, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 19:59:21,225 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 48 states. [2018-02-02 19:59:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:22,874 INFO L93 Difference]: Finished difference Result 533 states and 575 transitions. [2018-02-02 19:59:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 19:59:22,874 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 177 [2018-02-02 19:59:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:22,875 INFO L225 Difference]: With dead ends: 533 [2018-02-02 19:59:22,875 INFO L226 Difference]: Without dead ends: 533 [2018-02-02 19:59:22,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2724, Invalid=5108, Unknown=0, NotChecked=0, Total=7832 [2018-02-02 19:59:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-02 19:59:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 208. [2018-02-02 19:59:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 19:59:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-02-02 19:59:22,878 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 177 [2018-02-02 19:59:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:22,878 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-02-02 19:59:22,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 19:59:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-02-02 19:59:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-02 19:59:22,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:22,879 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:22,879 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -289423804, now seen corresponding path program 41 times [2018-02-02 19:59:22,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:22,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:24,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:24,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 19:59:24,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:24,149 INFO L182 omatonBuilderFactory]: Interpolants [20493#true, 20494#false, 20495#(<= 128 ~n), 20496#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 20497#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20498#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20499#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20500#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 20501#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 20502#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 20503#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 20504#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 20505#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 20506#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 20508#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20509#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20510#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20511#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20512#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20513#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20514#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 20515#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 20516#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 20517#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20518#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 20519#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20520#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20521#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 20522#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 20523#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20524#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20525#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20526#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 20527#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 20528#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 20529#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20530#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20531#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20532#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 20533#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20534#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20535#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20536#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 20537#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 20538#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 20539#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 20540#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 20541#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 348) (select |#length| ~a.base)))] [2018-02-02 19:59:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:24,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 19:59:24,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 19:59:24,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:59:24,150 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 49 states. [2018-02-02 19:59:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:25,956 INFO L93 Difference]: Finished difference Result 545 states and 588 transitions. [2018-02-02 19:59:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 19:59:25,957 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 181 [2018-02-02 19:59:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:25,958 INFO L225 Difference]: With dead ends: 545 [2018-02-02 19:59:25,958 INFO L226 Difference]: Without dead ends: 545 [2018-02-02 19:59:25,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2853, Invalid=5337, Unknown=0, NotChecked=0, Total=8190 [2018-02-02 19:59:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-02 19:59:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 212. [2018-02-02 19:59:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 19:59:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-02-02 19:59:25,960 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 181 [2018-02-02 19:59:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:25,960 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-02-02 19:59:25,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 19:59:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-02-02 19:59:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-02 19:59:25,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:25,961 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:25,961 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:25,961 INFO L82 PathProgramCache]: Analyzing trace with hash -262526181, now seen corresponding path program 42 times [2018-02-02 19:59:25,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:25,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:27,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:27,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 19:59:27,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:27,254 INFO L182 omatonBuilderFactory]: Interpolants [21383#true, 21384#false, 21385#(<= 128 ~n), 21386#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 21387#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21388#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21389#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21390#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 21391#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 21392#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 21393#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 21394#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 21395#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 21396#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21397#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 21398#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21399#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21400#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21401#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21402#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21403#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21404#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 21405#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 21406#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 21407#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21408#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 21409#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21410#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21411#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 21412#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 21413#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21414#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21415#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21416#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 21417#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 21418#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 21419#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21420#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21421#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21422#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 21423#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21424#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21425#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21426#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 21427#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 21428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 21429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 21430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 21431#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 21432#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 344) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:27,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 19:59:27,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 19:59:27,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=1485, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 19:59:27,254 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 50 states. [2018-02-02 19:59:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:29,289 INFO L93 Difference]: Finished difference Result 557 states and 601 transitions. [2018-02-02 19:59:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 19:59:29,289 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 185 [2018-02-02 19:59:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:29,290 INFO L225 Difference]: With dead ends: 557 [2018-02-02 19:59:29,290 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 19:59:29,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2985, Invalid=5571, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 19:59:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 19:59:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 216. [2018-02-02 19:59:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 19:59:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-02-02 19:59:29,294 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 185 [2018-02-02 19:59:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:29,295 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-02-02 19:59:29,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 19:59:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-02-02 19:59:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-02 19:59:29,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:29,296 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:29,296 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1833675662, now seen corresponding path program 43 times [2018-02-02 19:59:29,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:29,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:30,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:30,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 19:59:30,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:30,637 INFO L182 omatonBuilderFactory]: Interpolants [22292#true, 22293#false, 22294#(<= 128 ~n), 22295#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 22296#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22297#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22298#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 22300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 22301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 22302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 22303#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 22304#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 22305#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22306#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 22307#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22308#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22309#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22310#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22311#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22312#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22313#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 22314#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 22315#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 22316#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22317#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 22318#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22319#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 22321#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 22322#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22323#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22324#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22325#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 22326#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 22327#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 22328#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22329#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22330#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22331#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 22332#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22333#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22334#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 22336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 22337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 22338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 22339#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22340#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 22341#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 22342#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 340) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:30,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 19:59:30,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 19:59:30,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=1541, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 19:59:30,638 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 51 states. [2018-02-02 19:59:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:32,670 INFO L93 Difference]: Finished difference Result 569 states and 614 transitions. [2018-02-02 19:59:32,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 19:59:32,670 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 189 [2018-02-02 19:59:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:32,672 INFO L225 Difference]: With dead ends: 569 [2018-02-02 19:59:32,672 INFO L226 Difference]: Without dead ends: 569 [2018-02-02 19:59:32,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3120, Invalid=5810, Unknown=0, NotChecked=0, Total=8930 [2018-02-02 19:59:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-02-02 19:59:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 220. [2018-02-02 19:59:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 19:59:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-02-02 19:59:32,676 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 189 [2018-02-02 19:59:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:32,676 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-02-02 19:59:32,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 19:59:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-02-02 19:59:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 19:59:32,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:32,677 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:32,677 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1097074103, now seen corresponding path program 44 times [2018-02-02 19:59:32,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:32,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:34,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:34,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 19:59:34,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:34,200 INFO L182 omatonBuilderFactory]: Interpolants [23220#true, 23221#false, 23222#(<= 128 ~n), 23223#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 23224#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23225#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23226#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23227#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 23228#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 23229#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 23230#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 23231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 23232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 23233#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23234#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 23235#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23236#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23237#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23238#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23239#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23240#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 23242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 23243#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 23244#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23245#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 23246#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23247#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23248#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 23249#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 23250#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23251#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23252#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23253#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 23254#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 23255#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 23256#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23257#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23258#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23259#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 23260#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23261#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23262#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23263#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 23264#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 23265#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 23266#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 23267#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23268#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23269#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 23270#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 23271#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 336) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:34,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 19:59:34,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 19:59:34,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=1598, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 19:59:34,201 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 52 states. [2018-02-02 19:59:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:36,237 INFO L93 Difference]: Finished difference Result 581 states and 627 transitions. [2018-02-02 19:59:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 19:59:36,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 193 [2018-02-02 19:59:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:36,239 INFO L225 Difference]: With dead ends: 581 [2018-02-02 19:59:36,239 INFO L226 Difference]: Without dead ends: 581 [2018-02-02 19:59:36,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3258, Invalid=6054, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 19:59:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-02-02 19:59:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 224. [2018-02-02 19:59:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 19:59:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-02-02 19:59:36,242 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 193 [2018-02-02 19:59:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:36,243 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-02-02 19:59:36,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 19:59:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-02-02 19:59:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 19:59:36,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:36,243 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:36,243 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1073816416, now seen corresponding path program 45 times [2018-02-02 19:59:36,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:36,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:37,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:37,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-02 19:59:37,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:37,644 INFO L182 omatonBuilderFactory]: Interpolants [24192#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 24193#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24194#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 24196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 24197#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24198#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24199#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 24201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 24202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 24203#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24204#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24205#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 24207#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24208#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24209#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24210#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 24211#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 24212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 24213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 24214#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24215#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 24217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 24218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24219#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 332) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24167#true, 24168#false, 24169#(<= 128 ~n), 24170#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 24171#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24172#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24173#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24174#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 24175#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 24176#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 24177#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 24178#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 24179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 24180#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24181#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 24182#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24183#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24184#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24185#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24186#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24187#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24188#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 24189#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 24190#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 24191#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-02 19:59:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:37,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 19:59:37,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 19:59:37,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=1656, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 19:59:37,645 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 53 states. [2018-02-02 19:59:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:39,769 INFO L93 Difference]: Finished difference Result 593 states and 640 transitions. [2018-02-02 19:59:39,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 19:59:39,770 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 197 [2018-02-02 19:59:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:39,771 INFO L225 Difference]: With dead ends: 593 [2018-02-02 19:59:39,771 INFO L226 Difference]: Without dead ends: 593 [2018-02-02 19:59:39,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3399, Invalid=6303, Unknown=0, NotChecked=0, Total=9702 [2018-02-02 19:59:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-02 19:59:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 228. [2018-02-02 19:59:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 19:59:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-02-02 19:59:39,774 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 197 [2018-02-02 19:59:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:39,775 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-02-02 19:59:39,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 19:59:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-02-02 19:59:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-02 19:59:39,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:39,776 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:39,776 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1242907785, now seen corresponding path program 46 times [2018-02-02 19:59:39,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:39,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:41,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:41,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 19:59:41,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:41,285 INFO L182 omatonBuilderFactory]: Interpolants [25133#true, 25134#false, 25135#(<= 128 ~n), 25136#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 25137#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25138#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25139#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25140#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 25141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 25142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 25143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 25144#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 25145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 25146#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 25148#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25149#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25150#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25151#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25152#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25153#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 25155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 25156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 25157#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 25159#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25160#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 25162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 25163#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25164#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25165#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25166#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 25167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 25168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 25169#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25170#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25171#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25172#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 25173#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25174#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25175#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25176#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 25177#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 25178#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 25179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 25180#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25181#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 25183#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 25184#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 25185#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 82) ~n)), 25186#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 328) (select |#length| ~a.base)))] [2018-02-02 19:59:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:41,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 19:59:41,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 19:59:41,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=1715, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 19:59:41,286 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 54 states. [2018-02-02 19:59:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:43,523 INFO L93 Difference]: Finished difference Result 605 states and 653 transitions. [2018-02-02 19:59:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 19:59:43,523 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 201 [2018-02-02 19:59:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:43,524 INFO L225 Difference]: With dead ends: 605 [2018-02-02 19:59:43,524 INFO L226 Difference]: Without dead ends: 605 [2018-02-02 19:59:43,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3543, Invalid=6557, Unknown=0, NotChecked=0, Total=10100 [2018-02-02 19:59:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-02 19:59:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 232. [2018-02-02 19:59:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 19:59:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-02-02 19:59:43,529 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 201 [2018-02-02 19:59:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:43,529 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-02-02 19:59:43,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 19:59:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-02-02 19:59:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-02 19:59:43,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:43,531 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:43,531 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash 42817230, now seen corresponding path program 47 times [2018-02-02 19:59:43,531 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:43,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:59:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:45,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:59:45,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 19:59:45,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:59:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:45,109 INFO L182 omatonBuilderFactory]: Interpolants [26118#true, 26119#false, 26120#(<= 128 ~n), 26121#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 26122#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26123#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26124#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26125#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 26126#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 26127#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 26128#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 26129#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 26130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 26131#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 26133#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26134#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26135#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26136#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26137#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26138#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26139#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 26140#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 26141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 26142#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 26144#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26145#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 26147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 26148#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26149#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26150#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 26152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 26153#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 26154#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26155#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26156#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 26158#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26159#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26160#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 26162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 26163#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 26164#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 26165#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26166#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 26168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 26169#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 26170#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 82) ~n)), 26171#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 81) ~n)), 26172#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 324) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 19:59:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:59:45,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 19:59:45,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 19:59:45,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=1775, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:59:45,110 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 55 states. [2018-02-02 19:59:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:59:47,378 INFO L93 Difference]: Finished difference Result 617 states and 666 transitions. [2018-02-02 19:59:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 19:59:47,379 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 205 [2018-02-02 19:59:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:59:47,380 INFO L225 Difference]: With dead ends: 617 [2018-02-02 19:59:47,380 INFO L226 Difference]: Without dead ends: 617 [2018-02-02 19:59:47,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3690, Invalid=6816, Unknown=0, NotChecked=0, Total=10506 [2018-02-02 19:59:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-02-02 19:59:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 236. [2018-02-02 19:59:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 19:59:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-02-02 19:59:47,383 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 205 [2018-02-02 19:59:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:59:47,383 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-02-02 19:59:47,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 19:59:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-02-02 19:59:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-02 19:59:47,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:59:47,384 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:59:47,384 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 19:59:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1154191707, now seen corresponding path program 48 times [2018-02-02 19:59:47,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:59:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:59:47,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 19:59:48,057 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:59:48,060 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:59:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:59:48 BoogieIcfgContainer [2018-02-02 19:59:48,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:59:48,061 INFO L168 Benchmark]: Toolchain (without parser) took 82300.88 ms. Allocated memory was 407.4 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 364.3 MB in the beginning and 966.3 MB in the end (delta: -602.0 MB). Peak memory consumption was 561.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:59:48,062 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 407.4 MB. Free memory is still 370.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:59:48,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.29 ms. Allocated memory is still 407.4 MB. Free memory was 364.3 MB in the beginning and 353.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:59:48,062 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 407.4 MB. Free memory was 353.6 MB in the beginning and 352.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:59:48,062 INFO L168 Benchmark]: RCFGBuilder took 179.87 ms. Allocated memory is still 407.4 MB. Free memory was 352.3 MB in the beginning and 332.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:59:48,063 INFO L168 Benchmark]: TraceAbstraction took 81942.90 ms. Allocated memory was 407.4 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 332.9 MB in the beginning and 966.3 MB in the end (delta: -633.4 MB). Peak memory consumption was 530.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:59:48,064 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 407.4 MB. Free memory is still 370.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.29 ms. Allocated memory is still 407.4 MB. Free memory was 364.3 MB in the beginning and 353.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 407.4 MB. Free memory was 353.6 MB in the beginning and 352.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 179.87 ms. Allocated memory is still 407.4 MB. Free memory was 352.3 MB in the beginning and 332.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 81942.90 ms. Allocated memory was 407.4 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 332.9 MB in the beginning and 966.3 MB in the end (delta: -633.4 MB). Peak memory consumption was 530.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 210 with TraceHistMax 49, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 81.9s OverallTime, 52 OverallIterations, 49 TraceHistogramMax, 47.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1511 SDtfs, 59214 SDslu, 22685 SDs, 0 SdLazy, 26403 SolverSat, 14239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2703 GetRequests, 52 SyntacticMatches, 49 SemanticMatches, 2602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25560 ImplicationChecksByTransitivity, 53.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/72568 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 51 MinimizatonAttempts, 9264 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 31.2s InterpolantComputationTime, 5367 NumberOfCodeBlocks, 5367 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5316 ConstructedInterpolants, 0 QuantifiedInterpolants, 11266520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 4 PerfectInterpolantSequences, 0/72568 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-59-48-068.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-59-48-068.csv Completed graceful shutdown