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_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:04:30,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:04:30,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:04:30,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:04:30,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:04:30,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:04:30,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:04:30,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:04:30,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:04:30,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:04:30,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:04:30,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:04:30,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:04:30,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:04:30,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:04:30,598 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:04:30,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:04:30,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:04:30,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:04:30,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:04:30,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:04:30,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:04:30,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:04:30,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:04:30,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:04:30,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:04:30,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:04:30,608 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:04:30,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:04:30,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:04:30,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:04:30,609 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:04:30,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:04:30,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:04:30,620 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:04:30,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:04:30,620 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:04:30,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:04:30,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:04:30,620 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:04:30,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:04:30,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:04:30,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:04:30,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:04:30,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:04:30,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:04:30,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:04:30,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:04:30,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:04:30,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:04:30,662 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:04:30,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:04:30,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:04:30,668 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:04:30,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-02-04 02:04:30,828 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:04:30,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:04:30,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:04:30,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:04:30,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:04:30,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:30,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32677a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30, skipping insertion in model container [2018-02-04 02:04:30,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:30,845 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:04:30,871 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:04:30,955 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:04:30,968 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:04:30,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30 WrapperNode [2018-02-04 02:04:30,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:04:30,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:04:30,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:04:30,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:04:30,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:30,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:30,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:30,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:30,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:31,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:31,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... [2018-02-04 02:04:31,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:04:31,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:04:31,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:04:31,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:04:31,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:04:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:04:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:04:31,040 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:04:31,041 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:04:31,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:04:31,206 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:04:31,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:04:31 BoogieIcfgContainer [2018-02-04 02:04:31,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:04:31,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:04:31,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:04:31,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:04:31,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:04:30" (1/3) ... [2018-02-04 02:04:31,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12696471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:04:31, skipping insertion in model container [2018-02-04 02:04:31,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:04:30" (2/3) ... [2018-02-04 02:04:31,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12696471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:04:31, skipping insertion in model container [2018-02-04 02:04:31,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:04:31" (3/3) ... [2018-02-04 02:04:31,215 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i [2018-02-04 02:04:31,221 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:04:31,226 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 02:04:31,252 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:04:31,252 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:04:31,252 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:04:31,252 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:04:31,253 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:04:31,253 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:04:31,253 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:04:31,253 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:04:31,253 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:04:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 02:04:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 02:04:31,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:31,273 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:31,274 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 02:04:31,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:31,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:31,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:04:31,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,452 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-04 02:04:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:04:31,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:04:31,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:04:31,463 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 02:04:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:31,665 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 02:04:31,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:04:31,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 02:04:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:31,674 INFO L225 Difference]: With dead ends: 52 [2018-02-04 02:04:31,675 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 02:04:31,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:04:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 02:04:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 02:04:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 02:04:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 02:04:31,702 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 02:04:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:31,702 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 02:04:31,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:04:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 02:04:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 02:04:31,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:31,703 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:31,703 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 02:04:31,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:31,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:31,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:04:31,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,776 INFO L182 omatonBuilderFactory]: Interpolants [163#true, 164#false, 165#(<= 32768 ~n), 166#(and (= 0 |main_#t~malloc5.offset|) (<= 131072 (select |#length| |main_#t~malloc5.base|))), 167#(and (= |main_#t~post6.offset| 0) (<= 131072 (select |#length| |main_#t~post6.base|)))] [2018-02-04 02:04:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:04:31,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:04:31,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:04:31,778 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 02:04:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:31,846 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 02:04:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:04:31,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 02:04:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:31,848 INFO L225 Difference]: With dead ends: 48 [2018-02-04 02:04:31,848 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 02:04:31,849 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-04 02:04:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 02:04:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 02:04:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 02:04:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 02:04:31,853 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 02:04:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:31,853 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 02:04:31,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:04:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 02:04:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:04:31,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:31,854 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:31,854 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 02:04:31,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:31,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:31,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:04:31,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,935 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-04 02:04:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:31,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:04:31,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:04:31,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:04:31,936 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-04 02:04:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:32,000 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 02:04:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:04:32,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 02:04:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:32,002 INFO L225 Difference]: With dead ends: 45 [2018-02-04 02:04:32,002 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 02:04:32,002 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-04 02:04:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 02:04:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 02:04:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 02:04:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 02:04:32,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 02:04:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:32,006 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 02:04:32,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:04:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 02:04:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:04:32,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:32,007 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:32,007 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 02:04:32,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:32,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:32,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-04 02:04:32,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:04:32,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:04:32,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:32,151 INFO L182 omatonBuilderFactory]: Interpolants [368#(<= 32768 ~n), 369#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 370#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 371#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (select |#length| ~a.base) (* 4 ~n))), 372#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 131072 (select |#length| ~a.base))), 366#true, 367#false] [2018-02-04 02:04:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:32,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:04:32,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:04:32,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:04:32,152 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 02:04:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:32,234 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 02:04:32,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:04:32,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 02:04:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:32,238 INFO L225 Difference]: With dead ends: 53 [2018-02-04 02:04:32,238 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 02:04:32,238 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-04 02:04:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 02:04:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 02:04:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 02:04:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 02:04:32,242 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 02:04:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:32,242 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 02:04:32,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:04:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 02:04:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 02:04:32,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:32,242 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-04 02:04:32,243 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 02:04:32,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:32,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:32,412 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-04 02:04:32,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:32,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:04:32,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:32,413 INFO L182 omatonBuilderFactory]: Interpolants [480#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 481#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 482#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 483#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131068) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 476#true, 477#false, 478#(<= 32768 ~n), 479#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|))] [2018-02-04 02:04:32,413 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-04 02:04:32,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:04:32,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:04:32,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:04:32,414 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 8 states. [2018-02-04 02:04:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:32,541 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-04 02:04:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:04:32,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 02:04:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:32,545 INFO L225 Difference]: With dead ends: 65 [2018-02-04 02:04:32,545 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:04:32,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:04:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:04:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-02-04 02:04:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 02:04:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 02:04:32,551 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 21 [2018-02-04 02:04:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:32,551 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 02:04:32,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:04:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 02:04:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 02:04:32,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:32,552 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-04 02:04:32,552 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 02:04:32,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:32,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:32,743 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-04 02:04:32,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:32,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:04:32,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:32,744 INFO L182 omatonBuilderFactory]: Interpolants [608#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 609#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 610#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32767) ~n)), 611#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 612#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 131064) (select |#length| ~a.base))), 603#true, 604#false, 605#(<= 32768 ~n), 606#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 607#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:04:32,745 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-04 02:04:32,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:04:32,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:04:32,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:04:32,745 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 10 states. [2018-02-04 02:04:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:32,907 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-04 02:04:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:04:32,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-04 02:04:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:32,908 INFO L225 Difference]: With dead ends: 77 [2018-02-04 02:04:32,908 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 02:04:32,908 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-04 02:04:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 02:04:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2018-02-04 02:04:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 02:04:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 02:04:32,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 25 [2018-02-04 02:04:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:32,911 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 02:04:32,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:04:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 02:04:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:04:32,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:32,912 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-04 02:04:32,912 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 02:04:32,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:32,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:33,077 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-04 02:04:33,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:33,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:04:33,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:33,078 INFO L182 omatonBuilderFactory]: Interpolants [752#true, 753#false, 754#(<= 32768 ~n), 755#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 756#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 757#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 758#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 759#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 760#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 761#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32765) ~n)), 762#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131060) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:33,078 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-04 02:04:33,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:04:33,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:04:33,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:04:33,079 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-02-04 02:04:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:33,246 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 02:04:33,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:04:33,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 02:04:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:33,247 INFO L225 Difference]: With dead ends: 89 [2018-02-04 02:04:33,247 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 02:04:33,247 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-04 02:04:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 02:04:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2018-02-04 02:04:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 02:04:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 02:04:33,251 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 29 [2018-02-04 02:04:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:33,251 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 02:04:33,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:04:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 02:04:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:04:33,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:33,252 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-04 02:04:33,252 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1922524849, now seen corresponding path program 4 times [2018-02-04 02:04:33,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:33,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:33,416 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-04 02:04:33,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:33,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:04:33,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:33,417 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 929#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32765) ~n)), 930#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32764) ~n)), 931#(and (<= (+ (* 4 foo_~i~0) 131056) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 920#true, 921#false, 922#(<= 32768 ~n), 923#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 924#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 925#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 926#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 927#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:04:33,417 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-04 02:04:33,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:04:33,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:04:33,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:04:33,418 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 12 states. [2018-02-04 02:04:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:33,626 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-04 02:04:33,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:04:33,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-04 02:04:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:33,628 INFO L225 Difference]: With dead ends: 101 [2018-02-04 02:04:33,628 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 02:04:33,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:04:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 02:04:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2018-02-04 02:04:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 02:04:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-04 02:04:33,631 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 33 [2018-02-04 02:04:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:33,632 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-04 02:04:33,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:04:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-04 02:04:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 02:04:33,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:33,635 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-04 02:04:33,636 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -165817080, now seen corresponding path program 5 times [2018-02-04 02:04:33,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:33,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:33,966 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-04 02:04:33,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:33,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:04:33,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:33,967 INFO L182 omatonBuilderFactory]: Interpolants [1107#true, 1108#false, 1109#(<= 32768 ~n), 1110#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1111#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1112#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1113#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 1114#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1115#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 1116#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 1117#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32764) ~n)), 1118#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1119#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131052) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:33,967 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-04 02:04:33,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:04:33,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:04:33,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:04:33,968 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 13 states. [2018-02-04 02:04:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:34,181 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-04 02:04:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:04:34,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 02:04:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:34,182 INFO L225 Difference]: With dead ends: 113 [2018-02-04 02:04:34,182 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 02:04:34,182 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-04 02:04:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 02:04:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 68. [2018-02-04 02:04:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 02:04:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-02-04 02:04:34,185 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 37 [2018-02-04 02:04:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:34,185 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-02-04 02:04:34,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:04:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-02-04 02:04:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:04:34,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:34,186 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-04 02:04:34,186 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1502035935, now seen corresponding path program 6 times [2018-02-04 02:04:34,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:34,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:34,429 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-04 02:04:34,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:34,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:04:34,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:34,430 INFO L182 omatonBuilderFactory]: Interpolants [1313#true, 1314#false, 1315#(<= 32768 ~n), 1316#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1317#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1318#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1319#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 1320#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1321#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 1322#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 1323#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1324#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1325#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1326#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131048) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:34,431 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-04 02:04:34,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:04:34,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:04:34,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:04:34,431 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 14 states. [2018-02-04 02:04:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:34,758 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 02:04:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:04:34,759 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-04 02:04:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:34,759 INFO L225 Difference]: With dead ends: 125 [2018-02-04 02:04:34,759 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 02:04:34,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:04:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 02:04:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 72. [2018-02-04 02:04:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 02:04:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-02-04 02:04:34,762 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 41 [2018-02-04 02:04:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:34,763 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-02-04 02:04:34,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:04:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-02-04 02:04:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 02:04:34,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:34,764 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-04 02:04:34,764 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1040095434, now seen corresponding path program 7 times [2018-02-04 02:04:34,764 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:34,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:35,004 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-04 02:04:35,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:35,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:04:35,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:35,005 INFO L182 omatonBuilderFactory]: Interpolants [1538#true, 1539#false, 1540#(<= 32768 ~n), 1541#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1542#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1543#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1544#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 1545#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1546#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 1547#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 1548#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1549#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1550#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1551#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1552#(and (<= (+ (* 4 foo_~i~0) 131044) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:35,005 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-04 02:04:35,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:04:35,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:04:35,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:04:35,006 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 15 states. [2018-02-04 02:04:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:35,279 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-02-04 02:04:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:04:35,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 02:04:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:35,282 INFO L225 Difference]: With dead ends: 137 [2018-02-04 02:04:35,282 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 02:04:35,283 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-04 02:04:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 02:04:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 76. [2018-02-04 02:04:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 02:04:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-02-04 02:04:35,287 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 45 [2018-02-04 02:04:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:35,288 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-02-04 02:04:35,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:04:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-02-04 02:04:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 02:04:35,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:35,289 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-04 02:04:35,289 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2015753459, now seen corresponding path program 8 times [2018-02-04 02:04:35,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:35,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:35,515 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-04 02:04:35,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:35,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:04:35,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:35,515 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1793#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1794#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 1795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1796#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1797#(and (<= (+ (* 4 foo_~i~0) 131040) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1782#true, 1783#false, 1784#(<= 32768 ~n), 1785#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1786#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1787#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1788#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 1789#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1790#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 1791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n))] [2018-02-04 02:04:35,516 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-04 02:04:35,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:04:35,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:04:35,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:04:35,516 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 16 states. [2018-02-04 02:04:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:35,821 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-02-04 02:04:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:04:35,821 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-04 02:04:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:35,822 INFO L225 Difference]: With dead ends: 149 [2018-02-04 02:04:35,822 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 02:04:35,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:04:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 02:04:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 80. [2018-02-04 02:04:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 02:04:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-02-04 02:04:35,826 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 49 [2018-02-04 02:04:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:35,826 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-02-04 02:04:35,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:04:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-02-04 02:04:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:04:35,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:35,828 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-04 02:04:35,828 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1501631644, now seen corresponding path program 9 times [2018-02-04 02:04:35,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:35,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:36,080 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-04 02:04:36,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:36,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:04:36,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:36,081 INFO L182 omatonBuilderFactory]: Interpolants [2048#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2049#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2050#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2051#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 2052#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 2054#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 2055#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2056#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 2058#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 2059#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2060#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2061#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131036) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2045#true, 2046#false, 2047#(<= 32768 ~n)] [2018-02-04 02:04:36,081 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-04 02:04:36,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:04:36,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:04:36,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:04:36,082 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 17 states. [2018-02-04 02:04:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:36,431 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-04 02:04:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:04:36,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-04 02:04:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:36,432 INFO L225 Difference]: With dead ends: 161 [2018-02-04 02:04:36,432 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 02:04:36,432 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-04 02:04:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 02:04:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 84. [2018-02-04 02:04:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 02:04:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-02-04 02:04:36,435 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 53 [2018-02-04 02:04:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:36,435 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-02-04 02:04:36,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:04:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-02-04 02:04:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:04:36,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:36,436 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-04 02:04:36,436 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash 746440763, now seen corresponding path program 10 times [2018-02-04 02:04:36,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:36,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:36,761 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-04 02:04:36,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:36,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:04:36,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:36,762 INFO L182 omatonBuilderFactory]: Interpolants [2336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 2337#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2338#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2339#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 2340#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 2341#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 2342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2343#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2344#(and (<= (+ (* 4 foo_~i~0) 131032) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2327#true, 2328#false, 2329#(<= 32768 ~n), 2330#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2331#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2332#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2333#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 2334#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n))] [2018-02-04 02:04:36,762 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-04 02:04:36,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:04:36,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:04:36,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:04:36,763 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 18 states. [2018-02-04 02:04:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:37,085 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-02-04 02:04:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:04:37,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-02-04 02:04:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:37,086 INFO L225 Difference]: With dead ends: 173 [2018-02-04 02:04:37,087 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 02:04:37,087 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-04 02:04:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 02:04:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 88. [2018-02-04 02:04:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 02:04:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-02-04 02:04:37,090 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 57 [2018-02-04 02:04:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:37,090 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-02-04 02:04:37,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:04:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-02-04 02:04:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:04:37,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:37,092 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-04 02:04:37,092 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1417387630, now seen corresponding path program 11 times [2018-02-04 02:04:37,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:37,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:37,351 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-04 02:04:37,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:37,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:04:37,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:37,352 INFO L182 omatonBuilderFactory]: Interpolants [2628#true, 2629#false, 2630#(<= 32768 ~n), 2631#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2632#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2633#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2634#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 2635#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2636#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 2637#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 2638#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2639#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2640#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 2641#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 2642#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 2643#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 2644#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32758) ~n)), 2645#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2646#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131028) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:37,353 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-04 02:04:37,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:04:37,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:04:37,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:04:37,353 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 19 states. [2018-02-04 02:04:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:37,733 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2018-02-04 02:04:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:04:37,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-02-04 02:04:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:37,734 INFO L225 Difference]: With dead ends: 185 [2018-02-04 02:04:37,734 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 02:04:37,735 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-04 02:04:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 02:04:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 92. [2018-02-04 02:04:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 02:04:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-04 02:04:37,738 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 61 [2018-02-04 02:04:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:37,738 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-04 02:04:37,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:04:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-04 02:04:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 02:04:37,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:37,739 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-04 02:04:37,739 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1470072983, now seen corresponding path program 12 times [2018-02-04 02:04:37,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:37,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:38,063 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-04 02:04:38,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:38,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:04:38,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:38,064 INFO L182 omatonBuilderFactory]: Interpolants [2948#true, 2949#false, 2950#(<= 32768 ~n), 2951#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2952#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2953#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2954#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 2955#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2956#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 2957#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 2958#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2959#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2960#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 2961#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 2962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 2963#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 2964#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 2965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2966#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2967#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131024) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:38,064 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-04 02:04:38,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:04:38,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:04:38,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:04:38,065 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 20 states. [2018-02-04 02:04:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:38,530 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-04 02:04:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:04:38,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-04 02:04:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:38,531 INFO L225 Difference]: With dead ends: 197 [2018-02-04 02:04:38,531 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 02:04:38,532 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-04 02:04:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 02:04:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 96. [2018-02-04 02:04:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 02:04:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-02-04 02:04:38,535 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 65 [2018-02-04 02:04:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:38,535 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-02-04 02:04:38,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:04:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-02-04 02:04:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:04:38,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:38,536 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-04 02:04:38,536 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 184535488, now seen corresponding path program 13 times [2018-02-04 02:04:38,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:38,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:38,982 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-04 02:04:38,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:38,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:04:38,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:38,983 INFO L182 omatonBuilderFactory]: Interpolants [3296#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 3297#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3298#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 3300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 3301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 3302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 3303#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 3304#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3305#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3306#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3307#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131020) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3287#true, 3288#false, 3289#(<= 32768 ~n), 3290#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 3291#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3292#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3293#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 3294#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3295#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n))] [2018-02-04 02:04:38,983 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-04 02:04:38,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:04:38,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:04:38,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:04:38,984 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 21 states. [2018-02-04 02:04:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:39,420 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2018-02-04 02:04:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:04:39,421 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-02-04 02:04:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:39,421 INFO L225 Difference]: With dead ends: 209 [2018-02-04 02:04:39,421 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 02:04:39,422 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-04 02:04:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 02:04:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 100. [2018-02-04 02:04:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 02:04:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-04 02:04:39,425 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 69 [2018-02-04 02:04:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:39,426 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-04 02:04:39,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:04:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-04 02:04:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 02:04:39,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:39,426 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-04 02:04:39,426 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1905256297, now seen corresponding path program 14 times [2018-02-04 02:04:39,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:39,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:39,739 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-04 02:04:39,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:39,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:04:39,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:39,740 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 3649#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3650#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3651#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 3652#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3653#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 3654#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 3655#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3656#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 3658#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 3659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 3660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 3661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 3662#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3663#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3664#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3665#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3666#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131016) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3645#true, 3646#false, 3647#(<= 32768 ~n)] [2018-02-04 02:04:39,740 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-04 02:04:39,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:04:39,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:04:39,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:04:39,741 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 22 states. [2018-02-04 02:04:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:40,237 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-02-04 02:04:40,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:04:40,237 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-04 02:04:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:40,238 INFO L225 Difference]: With dead ends: 221 [2018-02-04 02:04:40,238 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 02:04:40,238 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-04 02:04:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 02:04:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 104. [2018-02-04 02:04:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 02:04:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-02-04 02:04:40,240 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 73 [2018-02-04 02:04:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:40,240 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-02-04 02:04:40,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:04:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-02-04 02:04:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:04:40,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:40,241 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-04 02:04:40,241 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash 819930094, now seen corresponding path program 15 times [2018-02-04 02:04:40,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:40,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:40,622 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-04 02:04:40,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:40,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:04:40,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:40,623 INFO L182 omatonBuilderFactory]: Interpolants [4032#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4033#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4034#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 4035#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 4036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 4037#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 4038#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 4039#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4040#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4041#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 4042#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4043#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4044#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131012) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4022#true, 4023#false, 4024#(<= 32768 ~n), 4025#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4026#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4027#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4028#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 4029#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4030#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 4031#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n))] [2018-02-04 02:04:40,623 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-04 02:04:40,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:04:40,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:04:40,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:04:40,624 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 23 states. [2018-02-04 02:04:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:41,258 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2018-02-04 02:04:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:04:41,259 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2018-02-04 02:04:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:41,260 INFO L225 Difference]: With dead ends: 233 [2018-02-04 02:04:41,260 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 02:04:41,261 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-04 02:04:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 02:04:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 108. [2018-02-04 02:04:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 02:04:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-04 02:04:41,266 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 77 [2018-02-04 02:04:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:41,266 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-04 02:04:41,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:04:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-04 02:04:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 02:04:41,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:41,267 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-04 02:04:41,267 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1550144571, now seen corresponding path program 16 times [2018-02-04 02:04:41,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:41,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:41,705 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-04 02:04:41,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:41,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:04:41,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:41,705 INFO L182 omatonBuilderFactory]: Interpolants [4418#true, 4419#false, 4420#(<= 32768 ~n), 4421#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4422#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4423#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4424#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 4425#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4426#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 4427#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 4428#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4429#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 4431#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 4432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 4433#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 4434#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 4435#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4436#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4437#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 4438#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4439#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 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 32752) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4441#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131008) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:41,706 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-04 02:04:41,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:04:41,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:04:41,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:04:41,706 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 24 states. [2018-02-04 02:04:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:42,300 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions. [2018-02-04 02:04:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:04:42,300 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-02-04 02:04:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:42,301 INFO L225 Difference]: With dead ends: 245 [2018-02-04 02:04:42,301 INFO L226 Difference]: Without dead ends: 245 [2018-02-04 02:04:42,302 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-04 02:04:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-04 02:04:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 112. [2018-02-04 02:04:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 02:04:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-02-04 02:04:42,304 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 81 [2018-02-04 02:04:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:42,304 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-02-04 02:04:42,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:04:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-02-04 02:04:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 02:04:42,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:42,304 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-04 02:04:42,305 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1156550628, now seen corresponding path program 17 times [2018-02-04 02:04:42,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:42,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:42,773 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-04 02:04:42,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:42,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:04:42,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:42,774 INFO L182 omatonBuilderFactory]: Interpolants [4833#true, 4834#false, 4835#(<= 32768 ~n), 4836#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4837#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4838#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4839#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 4840#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4841#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 4842#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 4843#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4844#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 4846#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 4847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 4848#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 4849#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 4850#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4851#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4852#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 4853#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4854#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 4855#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4856#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4857#(and (<= (+ (* 4 foo_~i~0) 131004) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:42,774 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-04 02:04:42,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:04:42,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:04:42,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:04:42,775 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2018-02-04 02:04:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:43,412 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2018-02-04 02:04:43,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:04:43,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-02-04 02:04:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:43,413 INFO L225 Difference]: With dead ends: 257 [2018-02-04 02:04:43,413 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 02:04:43,413 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-04 02:04:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 02:04:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 116. [2018-02-04 02:04:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 02:04:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-02-04 02:04:43,417 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 85 [2018-02-04 02:04:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:43,417 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-02-04 02:04:43,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:04:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-02-04 02:04:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 02:04:43,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:43,418 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-04 02:04:43,418 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash -556912397, now seen corresponding path program 18 times [2018-02-04 02:04:43,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:43,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:43,985 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-04 02:04:43,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:43,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:04:43,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:43,986 INFO L182 omatonBuilderFactory]: Interpolants [5267#true, 5268#false, 5269#(<= 32768 ~n), 5270#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5271#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5272#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5273#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 5274#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5275#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 5276#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 5277#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5278#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 5280#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 5281#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 5282#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 5283#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 5284#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5285#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5286#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 5287#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5288#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 5289#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5290#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5291#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5292#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 131000) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:43,986 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-04 02:04:43,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:04:43,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:04:43,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:04:43,987 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 26 states. [2018-02-04 02:04:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:44,636 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2018-02-04 02:04:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:04:44,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-02-04 02:04:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:44,639 INFO L225 Difference]: With dead ends: 269 [2018-02-04 02:04:44,640 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 02:04:44,640 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-04 02:04:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 02:04:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 120. [2018-02-04 02:04:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 02:04:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-02-04 02:04:44,643 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 89 [2018-02-04 02:04:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:44,643 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-02-04 02:04:44,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:04:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-02-04 02:04:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 02:04:44,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:44,644 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-04 02:04:44,644 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2038541898, now seen corresponding path program 19 times [2018-02-04 02:04:44,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:44,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:45,117 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-04 02:04:45,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:45,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:04:45,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:45,118 INFO L182 omatonBuilderFactory]: Interpolants [5720#true, 5721#false, 5722#(<= 32768 ~n), 5723#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5724#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5725#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5726#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 5727#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5728#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 5729#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 5730#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5731#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 5733#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 5734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 5735#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 5736#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 5737#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5738#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5739#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 5740#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5741#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 5742#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5743#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5744#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5745#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5746#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130996) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:45,118 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-04 02:04:45,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:04:45,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:04:45,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=473, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:04:45,119 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 27 states. [2018-02-04 02:04:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:45,964 INFO L93 Difference]: Finished difference Result 281 states and 302 transitions. [2018-02-04 02:04:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:04:45,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2018-02-04 02:04:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:45,966 INFO L225 Difference]: With dead ends: 281 [2018-02-04 02:04:45,966 INFO L226 Difference]: Without dead ends: 281 [2018-02-04 02:04:45,966 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-04 02:04:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-04 02:04:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 124. [2018-02-04 02:04:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 02:04:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-02-04 02:04:45,969 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 93 [2018-02-04 02:04:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:45,969 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-02-04 02:04:45,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:04:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-02-04 02:04:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 02:04:45,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:45,970 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-04 02:04:45,970 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1761126433, now seen corresponding path program 20 times [2018-02-04 02:04:45,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:45,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:46,523 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-04 02:04:46,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:46,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:04:46,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:46,524 INFO L182 omatonBuilderFactory]: Interpolants [6208#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 6209#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6210#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6211#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 6212#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 6214#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6215#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 6217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6219#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130992) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6192#true, 6193#false, 6194#(<= 32768 ~n), 6195#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 6196#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6197#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6198#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 6199#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 6201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 6202#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6203#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 6205#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 6206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 6207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n))] [2018-02-04 02:04:46,524 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-04 02:04:46,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:04:46,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:04:46,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=506, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:04:46,525 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 28 states. [2018-02-04 02:04:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:47,392 INFO L93 Difference]: Finished difference Result 293 states and 315 transitions. [2018-02-04 02:04:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:04:47,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-02-04 02:04:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:47,425 INFO L225 Difference]: With dead ends: 293 [2018-02-04 02:04:47,425 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 02:04:47,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=774, Invalid=1578, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 02:04:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 02:04:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 128. [2018-02-04 02:04:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 02:04:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-02-04 02:04:47,428 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 97 [2018-02-04 02:04:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:47,428 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-02-04 02:04:47,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:04:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-02-04 02:04:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 02:04:47,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:47,429 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-04 02:04:47,429 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1847647864, now seen corresponding path program 21 times [2018-02-04 02:04:47,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:47,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:47,980 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-04 02:04:47,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:47,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:04:47,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:47,981 INFO L182 omatonBuilderFactory]: Interpolants [6683#true, 6684#false, 6685#(<= 32768 ~n), 6686#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 6687#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6688#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6689#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 6690#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6691#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 6692#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 6693#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6694#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6695#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 6696#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 6697#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 6698#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 6699#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 6700#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6701#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6702#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 6703#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6704#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 6705#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6706#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6707#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 6708#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 6709#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6710#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6711#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130988) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:47,982 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-04 02:04:47,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 02:04:47,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 02:04:47,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=540, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:04:47,982 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 29 states. [2018-02-04 02:04:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:48,788 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-02-04 02:04:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:04:48,788 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2018-02-04 02:04:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:48,789 INFO L225 Difference]: With dead ends: 305 [2018-02-04 02:04:48,789 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 02:04:48,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:04:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 02:04:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 132. [2018-02-04 02:04:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 02:04:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-02-04 02:04:48,794 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 101 [2018-02-04 02:04:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:48,795 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-02-04 02:04:48,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 02:04:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-02-04 02:04:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 02:04:48,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:48,796 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-04 02:04:48,796 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1660415665, now seen corresponding path program 22 times [2018-02-04 02:04:48,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:48,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:49,466 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-04 02:04:49,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:49,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 02:04:49,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:49,467 INFO L182 omatonBuilderFactory]: Interpolants [7193#true, 7194#false, 7195#(<= 32768 ~n), 7196#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 7197#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7198#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 7200#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 7202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 7203#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7204#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7205#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 7206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 7207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 7208#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 7209#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 7210#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7211#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 7213#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 7215#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7216#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 7218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 7219#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7220#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 7221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7222#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130984) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:49,468 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-04 02:04:49,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:04:49,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:04:49,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=575, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:04:49,468 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 30 states. [2018-02-04 02:04:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:50,382 INFO L93 Difference]: Finished difference Result 317 states and 341 transitions. [2018-02-04 02:04:50,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:04:50,383 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 105 [2018-02-04 02:04:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:50,384 INFO L225 Difference]: With dead ends: 317 [2018-02-04 02:04:50,385 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 02:04:50,385 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-04 02:04:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 02:04:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 136. [2018-02-04 02:04:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 02:04:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-02-04 02:04:50,390 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 105 [2018-02-04 02:04:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:50,390 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-02-04 02:04:50,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:04:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-02-04 02:04:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 02:04:50,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:50,395 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-04 02:04:50,396 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash -857997146, now seen corresponding path program 23 times [2018-02-04 02:04:50,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:50,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:51,179 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-04 02:04:51,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:51,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:04:51,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:51,180 INFO L182 omatonBuilderFactory]: Interpolants [7744#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7745#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7746#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 7747#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 7748#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7749#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 7750#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32746) ~n)), 7751#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7752#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130980) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7722#true, 7723#false, 7724#(<= 32768 ~n), 7725#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 7726#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7727#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7728#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 7729#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7730#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 7731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 7732#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7733#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 7735#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 7736#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 7737#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 7738#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 7739#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7740#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7741#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 7742#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7743#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n))] [2018-02-04 02:04:51,181 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-04 02:04:51,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 02:04:51,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 02:04:51,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=611, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:04:51,182 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 31 states. [2018-02-04 02:04:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:51,987 INFO L93 Difference]: Finished difference Result 329 states and 354 transitions. [2018-02-04 02:04:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:04:51,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-02-04 02:04:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:51,988 INFO L225 Difference]: With dead ends: 329 [2018-02-04 02:04:51,988 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 02:04:51,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=1980, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 02:04:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 02:04:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 140. [2018-02-04 02:04:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 02:04:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 02:04:51,993 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 109 [2018-02-04 02:04:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:51,993 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 02:04:51,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 02:04:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 02:04:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 02:04:51,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:51,994 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-04 02:04:51,994 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash 132803709, now seen corresponding path program 24 times [2018-02-04 02:04:51,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:52,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:52,572 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-04 02:04:52,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:52,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 02:04:52,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:52,572 INFO L182 omatonBuilderFactory]: Interpolants [8270#true, 8271#false, 8272#(<= 32768 ~n), 8273#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 8274#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8275#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8276#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 8277#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8278#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 8279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 8280#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8281#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8282#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 8283#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 8284#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 8285#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 8286#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 8287#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8288#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8289#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 8290#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8291#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 8292#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8293#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8294#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 8295#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 8296#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8297#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 8298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 8299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8301#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130976) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:52,573 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-04 02:04:52,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 02:04:52,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 02:04:52,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=648, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:04:52,573 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 32 states. [2018-02-04 02:04:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:53,513 INFO L93 Difference]: Finished difference Result 341 states and 367 transitions. [2018-02-04 02:04:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:04:53,514 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2018-02-04 02:04:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:53,515 INFO L225 Difference]: With dead ends: 341 [2018-02-04 02:04:53,515 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 02:04:53,516 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-04 02:04:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 02:04:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 144. [2018-02-04 02:04:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 02:04:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-02-04 02:04:53,521 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 113 [2018-02-04 02:04:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:53,521 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-02-04 02:04:53,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 02:04:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-02-04 02:04:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 02:04:53,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:53,521 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-04 02:04:53,521 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:53,521 INFO L82 PathProgramCache]: Analyzing trace with hash -73329452, now seen corresponding path program 25 times [2018-02-04 02:04:53,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:53,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:54,300 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-04 02:04:54,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:54,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:04:54,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:54,301 INFO L182 omatonBuilderFactory]: Interpolants [8837#true, 8838#false, 8839#(<= 32768 ~n), 8840#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 8841#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8842#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8843#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 8844#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 8846#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 8847#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8848#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8849#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 8850#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 8851#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 8852#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 8853#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 8854#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8855#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8856#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 8857#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8858#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 8859#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8860#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8861#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 8862#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 8863#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8864#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 8865#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 8866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 8867#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8868#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8869#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 130972) (select |#length| ~a.base)))] [2018-02-04 02:04:54,302 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-04 02:04:54,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 02:04:54,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 02:04:54,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=686, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:04:54,303 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 33 states. [2018-02-04 02:04:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:55,320 INFO L93 Difference]: Finished difference Result 353 states and 380 transitions. [2018-02-04 02:04:55,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:04:55,320 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-02-04 02:04:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:55,322 INFO L225 Difference]: With dead ends: 353 [2018-02-04 02:04:55,322 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 02:04:55,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1149, Invalid=2273, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 02:04:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 02:04:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 148. [2018-02-04 02:04:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 02:04:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-02-04 02:04:55,327 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 117 [2018-02-04 02:04:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:55,328 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-02-04 02:04:55,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 02:04:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-02-04 02:04:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 02:04:55,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:55,329 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-04 02:04:55,329 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1754118571, now seen corresponding path program 26 times [2018-02-04 02:04:55,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:55,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:56,060 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-04 02:04:56,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:56,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 02:04:56,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:56,061 INFO L182 omatonBuilderFactory]: Interpolants [9423#true, 9424#false, 9425#(<= 32768 ~n), 9426#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 9427#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9428#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 9430#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9431#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 9432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 9433#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9434#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9435#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 9436#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 9437#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 9438#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 9439#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 9440#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9441#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9442#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 9443#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9444#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 9445#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9446#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9447#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 9448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 9449#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9450#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 9451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 9452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 9453#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9454#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 9455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 9456#(and (<= (+ (* 4 foo_~i~0) 130968) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:56,062 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-04 02:04:56,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:04:56,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:04:56,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=725, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:04:56,062 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 34 states. [2018-02-04 02:04:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:57,134 INFO L93 Difference]: Finished difference Result 365 states and 393 transitions. [2018-02-04 02:04:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:04:57,134 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 121 [2018-02-04 02:04:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:57,135 INFO L225 Difference]: With dead ends: 365 [2018-02-04 02:04:57,135 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 02:04:57,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1233, Invalid=2427, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 02:04:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 02:04:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 152. [2018-02-04 02:04:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 02:04:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-02-04 02:04:57,140 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 121 [2018-02-04 02:04:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:57,140 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-02-04 02:04:57,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:04:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-02-04 02:04:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 02:04:57,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:57,140 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-04 02:04:57,140 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1839326462, now seen corresponding path program 27 times [2018-02-04 02:04:57,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:57,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:58,001 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-04 02:04:58,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:58,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 02:04:58,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:58,002 INFO L182 omatonBuilderFactory]: Interpolants [10048#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10049#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 10050#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10051#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10052#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 10053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 10054#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10055#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 10056#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 10057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 10058#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10059#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 10060#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32742) ~n)), 10061#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32741) ~n)), 10062#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 130964) (select |#length| ~a.base))), 10028#true, 10029#false, 10030#(<= 32768 ~n), 10031#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 10032#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10033#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10034#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 10035#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 10037#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 10038#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10039#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10040#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 10041#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 10042#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 10043#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 10044#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 10045#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10046#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10047#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n))] [2018-02-04 02:04:58,003 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-04 02:04:58,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 02:04:58,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 02:04:58,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=765, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:04:58,006 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 35 states. [2018-02-04 02:04:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:58,979 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2018-02-04 02:04:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:04:58,979 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 125 [2018-02-04 02:04:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:58,980 INFO L225 Difference]: With dead ends: 377 [2018-02-04 02:04:58,980 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 02:04:58,981 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-04 02:04:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 02:04:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 156. [2018-02-04 02:04:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 02:04:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-02-04 02:04:58,984 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 125 [2018-02-04 02:04:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:58,984 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-02-04 02:04:58,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 02:04:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-02-04 02:04:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 02:04:58,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:58,984 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-04 02:04:58,984 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:04:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1344276263, now seen corresponding path program 28 times [2018-02-04 02:04:58,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:59,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:59,690 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-04 02:04:59,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:59,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 02:04:59,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:04:59,690 INFO L182 omatonBuilderFactory]: Interpolants [10652#true, 10653#false, 10654#(<= 32768 ~n), 10655#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 10656#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10657#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10658#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 10659#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 10661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 10662#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10663#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10664#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 10665#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 10666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 10667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 10668#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 10669#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10670#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10671#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 10672#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 10674#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10675#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10676#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 10677#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 10678#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10679#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 10680#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 10681#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 10682#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10683#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 10684#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 10685#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32741) ~n)), 10686#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10687#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130960) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:04:59,691 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-04 02:04:59,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:04:59,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:04:59,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:04:59,692 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 36 states. [2018-02-04 02:05:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:00,773 INFO L93 Difference]: Finished difference Result 389 states and 419 transitions. [2018-02-04 02:05:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:05:00,773 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 129 [2018-02-04 02:05:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:00,774 INFO L225 Difference]: With dead ends: 389 [2018-02-04 02:05:00,774 INFO L226 Difference]: Without dead ends: 389 [2018-02-04 02:05:00,775 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-04 02:05:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-04 02:05:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 160. [2018-02-04 02:05:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 02:05:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-02-04 02:05:00,777 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 129 [2018-02-04 02:05:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:00,777 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-02-04 02:05:00,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:05:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-02-04 02:05:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 02:05:00,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:00,777 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-04 02:05:00,777 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1526797104, now seen corresponding path program 29 times [2018-02-04 02:05:00,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:00,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:01,566 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-04 02:05:01,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:01,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:05:01,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:01,568 INFO L182 omatonBuilderFactory]: Interpolants [11328#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11329#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 11330#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11331#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130956) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11295#true, 11296#false, 11297#(<= 32768 ~n), 11298#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 11299#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11300#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 11302#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11303#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 11304#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 11305#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11306#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11307#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 11308#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 11309#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 11310#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 11311#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 11312#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11313#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11314#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 11315#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11316#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 11317#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11318#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11319#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 11320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 11321#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11322#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 11323#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 11324#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 11325#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11326#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 11327#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n))] [2018-02-04 02:05:01,568 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-04 02:05:01,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 02:05:01,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 02:05:01,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=848, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:05:01,569 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 37 states. [2018-02-04 02:05:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:02,921 INFO L93 Difference]: Finished difference Result 401 states and 432 transitions. [2018-02-04 02:05:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:05:02,921 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2018-02-04 02:05:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:02,922 INFO L225 Difference]: With dead ends: 401 [2018-02-04 02:05:02,923 INFO L226 Difference]: Without dead ends: 401 [2018-02-04 02:05:02,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1503, Invalid=2919, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 02:05:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-04 02:05:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 164. [2018-02-04 02:05:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 02:05:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-02-04 02:05:02,927 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 133 [2018-02-04 02:05:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:02,927 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-02-04 02:05:02,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 02:05:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-02-04 02:05:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 02:05:02,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:02,928 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-04 02:05:02,928 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash 13576711, now seen corresponding path program 30 times [2018-02-04 02:05:02,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:02,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:03,689 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-04 02:05:03,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:03,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 02:05:03,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:03,690 INFO L182 omatonBuilderFactory]: Interpolants [11968#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11969#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 11970#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 11971#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 11972#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 11973#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 11974#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11975#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11976#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 11977#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11978#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 11979#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11980#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11981#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 11982#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 11983#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11984#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 11985#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 11986#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 11987#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11988#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 11989#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 11990#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11991#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11992#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 11993#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32738) ~n)), 11994#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130952) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11957#true, 11958#false, 11959#(<= 32768 ~n), 11960#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 11961#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11962#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11963#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 11964#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 11966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 11967#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:05:03,690 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-04 02:05:03,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:05:03,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:05:03,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:05:03,691 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 38 states. [2018-02-04 02:05:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:04,841 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2018-02-04 02:05:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:05:04,841 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 137 [2018-02-04 02:05:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:04,842 INFO L225 Difference]: With dead ends: 413 [2018-02-04 02:05:04,842 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 02:05:04,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1599, Invalid=3093, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 02:05:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 02:05:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 168. [2018-02-04 02:05:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 02:05:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-02-04 02:05:04,845 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 137 [2018-02-04 02:05:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:04,846 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-02-04 02:05:04,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:05:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-02-04 02:05:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 02:05:04,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:04,846 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-04 02:05:04,847 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1366818142, now seen corresponding path program 31 times [2018-02-04 02:05:04,847 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:04,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:05,617 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-04 02:05:05,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:05,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:05:05,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:05,617 INFO L182 omatonBuilderFactory]: Interpolants [12672#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 12674#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32738) ~n)), 12675#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 12676#(and (<= (+ (* 4 foo_~i~0) 130948) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 12638#true, 12639#false, 12640#(<= 32768 ~n), 12641#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 12642#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12643#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12644#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 12645#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12646#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 12647#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 12648#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12649#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12650#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 12651#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 12652#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 12653#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 12654#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 12655#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12656#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 12658#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 12660#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12661#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12662#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 12663#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 12664#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12665#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 12666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 12667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 12668#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12669#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 12670#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 12671#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:05:05,618 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-04 02:05:05,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 02:05:05,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 02:05:05,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=935, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:05:05,618 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 39 states. [2018-02-04 02:05:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:06,857 INFO L93 Difference]: Finished difference Result 425 states and 458 transitions. [2018-02-04 02:05:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:05:06,857 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 141 [2018-02-04 02:05:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:06,858 INFO L225 Difference]: With dead ends: 425 [2018-02-04 02:05:06,858 INFO L226 Difference]: Without dead ends: 425 [2018-02-04 02:05:06,859 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-04 02:05:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-04 02:05:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 172. [2018-02-04 02:05:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 02:05:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-02-04 02:05:06,861 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 141 [2018-02-04 02:05:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:06,862 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-02-04 02:05:06,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 02:05:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-02-04 02:05:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 02:05:06,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:06,862 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-04 02:05:06,863 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1337373387, now seen corresponding path program 32 times [2018-02-04 02:05:06,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:06,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:07,777 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-04 02:05:07,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:07,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 02:05:07,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:07,778 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32736) ~n)), 13377#(and (<= (+ (* 4 foo_~i~0) 130944) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 13338#true, 13339#false, 13340#(<= 32768 ~n), 13341#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 13342#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13343#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13344#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 13345#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13346#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 13347#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 13348#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13349#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13350#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 13351#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 13352#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 13353#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 13354#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 13355#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13356#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13357#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 13358#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13359#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 13360#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13361#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13362#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 13363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 13364#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13365#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 13366#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 13367#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 13368#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13369#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 13370#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 13371#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13372#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 13373#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 13374#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13375#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:07,779 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-04 02:05:07,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 02:05:07,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 02:05:07,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=980, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:05:07,780 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 40 states. [2018-02-04 02:05:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:09,110 INFO L93 Difference]: Finished difference Result 437 states and 471 transitions. [2018-02-04 02:05:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:05:09,110 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 145 [2018-02-04 02:05:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:09,111 INFO L225 Difference]: With dead ends: 437 [2018-02-04 02:05:09,111 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 02:05:09,112 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-04 02:05:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 02:05:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 176. [2018-02-04 02:05:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 02:05:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-02-04 02:05:09,114 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 145 [2018-02-04 02:05:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:09,115 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-02-04 02:05:09,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 02:05:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-02-04 02:05:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 02:05:09,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:09,116 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-04 02:05:09,116 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1548691060, now seen corresponding path program 33 times [2018-02-04 02:05:09,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:09,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:10,101 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-04 02:05:10,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:10,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 02:05:10,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:10,101 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14081#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 14082#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 14083#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14084#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 14085#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 14086#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 14087#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14088#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 14089#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 14090#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14091#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14092#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 14093#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14094#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 14095#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32736) ~n)), 14096#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14097#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130940) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14057#true, 14058#false, 14059#(<= 32768 ~n), 14060#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 14061#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14062#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14063#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 14064#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14065#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 14066#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 14067#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14068#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14069#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 14070#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 14071#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 14072#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 14073#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 14074#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14075#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14076#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 14077#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14078#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 14079#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:05:10,102 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-04 02:05:10,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 02:05:10,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 02:05:10,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1026, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:05:10,102 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 41 states. [2018-02-04 02:05:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:11,394 INFO L93 Difference]: Finished difference Result 449 states and 484 transitions. [2018-02-04 02:05:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:05:11,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 149 [2018-02-04 02:05:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:11,416 INFO L225 Difference]: With dead ends: 449 [2018-02-04 02:05:11,418 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 02:05:11,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1905, Invalid=3645, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 02:05:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 02:05:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 180. [2018-02-04 02:05:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 02:05:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-02-04 02:05:11,422 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 149 [2018-02-04 02:05:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:11,425 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-02-04 02:05:11,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 02:05:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-02-04 02:05:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 02:05:11,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:11,426 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-04 02:05:11,426 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:11,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585251, now seen corresponding path program 34 times [2018-02-04 02:05:11,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:11,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:12,469 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-04 02:05:12,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:12,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 02:05:12,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:12,469 INFO L182 omatonBuilderFactory]: Interpolants [14795#true, 14796#false, 14797#(<= 32768 ~n), 14798#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 14799#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14800#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14801#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 14802#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14803#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 14804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 14805#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14806#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14807#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 14808#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 14809#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 14810#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 14811#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 14812#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14813#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14814#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 14815#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 14817#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14818#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14819#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 14820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 14821#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14822#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 14823#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 14824#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 14825#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14826#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 14827#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 14828#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14829#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14830#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 14831#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14832#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 14833#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14834#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 14835#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14836#(and (<= (+ (* 4 foo_~i~0) 130936) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:12,469 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-04 02:05:12,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 02:05:12,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 02:05:12,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1073, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:05:12,470 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 42 states. [2018-02-04 02:05:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:13,862 INFO L93 Difference]: Finished difference Result 461 states and 497 transitions. [2018-02-04 02:05:13,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:05:13,863 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 153 [2018-02-04 02:05:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:13,864 INFO L225 Difference]: With dead ends: 461 [2018-02-04 02:05:13,864 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 02:05:13,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2013, Invalid=3839, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 02:05:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 02:05:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 184. [2018-02-04 02:05:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 02:05:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-02-04 02:05:13,897 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 153 [2018-02-04 02:05:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:13,898 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-02-04 02:05:13,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 02:05:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-02-04 02:05:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 02:05:13,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:13,899 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-04 02:05:13,899 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1315330118, now seen corresponding path program 35 times [2018-02-04 02:05:13,900 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:13,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:14,817 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-04 02:05:14,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:14,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 02:05:14,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:14,818 INFO L182 omatonBuilderFactory]: Interpolants [15552#true, 15553#false, 15554#(<= 32768 ~n), 15555#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 15556#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15557#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15558#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 15559#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15560#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 15561#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 15562#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15563#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15564#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 15565#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 15566#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 15567#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 15568#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 15569#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15570#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15571#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 15572#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15573#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 15574#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15575#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15576#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 15577#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 15578#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15579#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 15580#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 15581#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 15582#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15583#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 15584#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 15585#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15586#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15587#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 15588#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15589#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 15590#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15591#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15592#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 15593#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 15594#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130932) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:14,818 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-04 02:05:14,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 02:05:14,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 02:05:14,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=1121, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:05:14,819 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 43 states. [2018-02-04 02:05:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:16,313 INFO L93 Difference]: Finished difference Result 473 states and 510 transitions. [2018-02-04 02:05:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:05:16,313 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2018-02-04 02:05:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:16,314 INFO L225 Difference]: With dead ends: 473 [2018-02-04 02:05:16,315 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 02:05:16,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2124, Invalid=4038, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 02:05:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 02:05:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 188. [2018-02-04 02:05:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 02:05:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-04 02:05:16,322 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 157 [2018-02-04 02:05:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:16,325 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-04 02:05:16,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 02:05:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-04 02:05:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 02:05:16,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:16,326 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-04 02:05:16,326 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2023123345, now seen corresponding path program 36 times [2018-02-04 02:05:16,327 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:16,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:17,397 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-04 02:05:17,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:17,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 02:05:17,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:17,398 INFO L182 omatonBuilderFactory]: Interpolants [16328#true, 16329#false, 16330#(<= 32768 ~n), 16331#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 16332#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16333#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16334#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 16335#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 16337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 16338#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16339#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16340#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 16341#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 16342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 16343#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 16344#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 16345#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16346#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16347#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 16348#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 16350#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16351#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16352#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 16353#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 16354#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16355#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 16356#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 16357#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 16358#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16359#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 16360#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 16361#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16362#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 16363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 16364#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16365#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 16366#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16367#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16368#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 16369#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 16370#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 16371#(and (<= (+ (* 4 foo_~i~0) 130928) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:17,398 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-04 02:05:17,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 02:05:17,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 02:05:17,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1170, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:05:17,399 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 44 states. [2018-02-04 02:05:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:18,931 INFO L93 Difference]: Finished difference Result 485 states and 523 transitions. [2018-02-04 02:05:18,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 02:05:18,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 161 [2018-02-04 02:05:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:18,932 INFO L225 Difference]: With dead ends: 485 [2018-02-04 02:05:18,932 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 02:05:18,933 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-04 02:05:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 02:05:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 192. [2018-02-04 02:05:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 02:05:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-02-04 02:05:18,935 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 161 [2018-02-04 02:05:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:18,935 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-02-04 02:05:18,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 02:05:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-02-04 02:05:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 02:05:18,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:18,936 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-04 02:05:18,936 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 220227560, now seen corresponding path program 37 times [2018-02-04 02:05:18,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:18,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:19,960 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-04 02:05:19,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:19,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 02:05:19,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:19,961 INFO L182 omatonBuilderFactory]: Interpolants [17152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 17153#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 17155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 17156#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17157#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 17159#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17160#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 17161#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17162#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17163#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 17164#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17165#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 17166#(and (<= (+ foo_~i~0 32731) ~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) 130924) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17123#true, 17124#false, 17125#(<= 32768 ~n), 17126#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 17127#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17128#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17129#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 17130#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 17132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 17133#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17134#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17135#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 17136#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 17137#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 17138#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 17139#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 17140#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17141#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 17143#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17144#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 17145#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17146#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 17148#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 17149#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17150#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 17151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n))] [2018-02-04 02:05:19,961 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-04 02:05:19,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 02:05:19,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 02:05:19,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=1220, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:05:19,961 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 45 states. [2018-02-04 02:05:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:21,498 INFO L93 Difference]: Finished difference Result 497 states and 536 transitions. [2018-02-04 02:05:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 02:05:21,513 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 165 [2018-02-04 02:05:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:21,515 INFO L225 Difference]: With dead ends: 497 [2018-02-04 02:05:21,515 INFO L226 Difference]: Without dead ends: 497 [2018-02-04 02:05:21,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2355, Invalid=4451, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 02:05:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-04 02:05:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 196. [2018-02-04 02:05:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 02:05:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-02-04 02:05:21,518 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 165 [2018-02-04 02:05:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:21,518 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-02-04 02:05:21,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 02:05:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-02-04 02:05:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 02:05:21,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:21,519 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-04 02:05:21,519 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 893739711, now seen corresponding path program 38 times [2018-02-04 02:05:21,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:21,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:22,542 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-04 02:05:22,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:22,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 02:05:22,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:22,543 INFO L182 omatonBuilderFactory]: Interpolants [17937#true, 17938#false, 17939#(<= 32768 ~n), 17940#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 17941#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17942#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17943#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 17944#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17945#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 17946#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 17947#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17948#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17949#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 17950#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 17951#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 17952#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 17953#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 17954#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17955#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17956#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 17957#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17958#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 17959#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17960#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17961#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 17962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 17963#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17964#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 17965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 17966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 17967#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17968#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 17969#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 17970#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17971#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17972#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 17973#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17974#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 17975#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17976#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17977#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 17978#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17979#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17980#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 17981#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17982#(and (<= (+ (* 4 foo_~i~0) 130920) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:22,543 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-04 02:05:22,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 02:05:22,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 02:05:22,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=1271, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:05:22,544 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 46 states. [2018-02-04 02:05:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:24,149 INFO L93 Difference]: Finished difference Result 509 states and 549 transitions. [2018-02-04 02:05:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 02:05:24,150 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 169 [2018-02-04 02:05:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:24,151 INFO L225 Difference]: With dead ends: 509 [2018-02-04 02:05:24,151 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 02:05:24,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2475, Invalid=4665, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 02:05:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 02:05:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 200. [2018-02-04 02:05:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 02:05:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-02-04 02:05:24,154 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 169 [2018-02-04 02:05:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:24,155 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-02-04 02:05:24,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 02:05:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-02-04 02:05:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 02:05:24,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:24,156 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-04 02:05:24,156 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2050169366, now seen corresponding path program 39 times [2018-02-04 02:05:24,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:24,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:25,305 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-04 02:05:25,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:25,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 02:05:25,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:25,305 INFO L182 omatonBuilderFactory]: Interpolants [18816#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 130916) (select |#length| ~a.base))), 18770#true, 18771#false, 18772#(<= 32768 ~n), 18773#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 18774#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18775#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18776#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 18777#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18778#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 18779#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 18780#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18781#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18782#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 18783#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 18784#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 18785#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 18786#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 18787#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18788#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18789#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 18790#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 18792#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18793#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18794#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 18795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 18796#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18797#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 18798#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 18799#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 18800#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18801#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 18802#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 18803#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 18805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 18806#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18807#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 18808#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18809#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18810#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 18811#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18812#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18813#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18814#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 18815#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:25,306 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-04 02:05:25,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 02:05:25,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 02:05:25,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=1323, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:05:25,306 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 47 states. [2018-02-04 02:05:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:27,054 INFO L93 Difference]: Finished difference Result 521 states and 562 transitions. [2018-02-04 02:05:27,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 02:05:27,054 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 173 [2018-02-04 02:05:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:27,055 INFO L225 Difference]: With dead ends: 521 [2018-02-04 02:05:27,055 INFO L226 Difference]: Without dead ends: 521 [2018-02-04 02:05:27,056 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-04 02:05:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-04 02:05:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 204. [2018-02-04 02:05:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 02:05:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-02-04 02:05:27,059 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 173 [2018-02-04 02:05:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:27,059 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-02-04 02:05:27,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 02:05:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-02-04 02:05:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 02:05:27,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:27,061 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-04 02:05:27,061 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1741206035, now seen corresponding path program 40 times [2018-02-04 02:05:27,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:27,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:28,181 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-04 02:05:28,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:28,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 02:05:28,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:28,182 INFO L182 omatonBuilderFactory]: Interpolants [19648#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19649#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 19650#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 19651#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 19652#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19653#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 19654#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 19655#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19656#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 19658#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 19660#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19661#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19662#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 19663#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19664#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19665#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19666#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19667#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 19668#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 19669#(and (<= (+ (* 4 foo_~i~0) 130912) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 19622#true, 19623#false, 19624#(<= 32768 ~n), 19625#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 19626#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19627#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19628#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 19629#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19630#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 19631#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 19632#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19633#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19634#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 19635#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 19636#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 19637#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 19638#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 19639#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19640#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19641#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 19642#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19643#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 19644#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19645#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19646#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 19647#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n))] [2018-02-04 02:05:28,182 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-04 02:05:28,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 02:05:28,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 02:05:28,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=880, Invalid=1376, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 02:05:28,183 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 48 states. [2018-02-04 02:05:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:29,819 INFO L93 Difference]: Finished difference Result 533 states and 575 transitions. [2018-02-04 02:05:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 02:05:29,820 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 177 [2018-02-04 02:05:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:29,821 INFO L225 Difference]: With dead ends: 533 [2018-02-04 02:05:29,821 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 02:05:29,821 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-04 02:05:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 02:05:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 208. [2018-02-04 02:05:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 02:05:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-02-04 02:05:29,824 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 177 [2018-02-04 02:05:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:29,824 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-02-04 02:05:29,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 02:05:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-02-04 02:05:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-04 02:05:29,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:29,825 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-04 02:05:29,825 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash -289423804, now seen corresponding path program 41 times [2018-02-04 02:05:29,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:29,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:31,049 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-04 02:05:31,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:31,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 02:05:31,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:31,050 INFO L182 omatonBuilderFactory]: Interpolants [20493#true, 20494#false, 20495#(<= 32768 ~n), 20496#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 20497#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20498#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20499#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 20500#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20501#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 20502#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 20503#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20504#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20505#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 20506#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 20507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 20508#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 20509#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 20510#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20511#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20512#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 20513#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20514#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 20515#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20516#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20517#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 20518#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 20519#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20520#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 20521#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 20522#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 20523#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20524#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 20525#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 20526#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20527#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 20528#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 20529#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20530#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 20531#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20532#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20533#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 20534#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20535#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20536#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20537#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20538#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 20539#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 20540#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32727) ~n)), 20541#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130908) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:31,050 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-04 02:05:31,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 02:05:31,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 02:05:31,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 02:05:31,050 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 49 states. [2018-02-04 02:05:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:32,883 INFO L93 Difference]: Finished difference Result 545 states and 588 transitions. [2018-02-04 02:05:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 02:05:32,884 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 181 [2018-02-04 02:05:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:32,885 INFO L225 Difference]: With dead ends: 545 [2018-02-04 02:05:32,885 INFO L226 Difference]: Without dead ends: 545 [2018-02-04 02:05:32,885 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-04 02:05:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-04 02:05:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 212. [2018-02-04 02:05:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 02:05:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-02-04 02:05:32,889 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 181 [2018-02-04 02:05:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:32,889 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-02-04 02:05:32,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 02:05:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-02-04 02:05:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 02:05:32,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:32,889 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-04 02:05:32,890 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash -262526181, now seen corresponding path program 42 times [2018-02-04 02:05:32,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:32,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:34,146 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-04 02:05:34,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:34,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 02:05:34,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:34,146 INFO L182 omatonBuilderFactory]: Interpolants [21383#true, 21384#false, 21385#(<= 32768 ~n), 21386#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 21387#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21388#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21389#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 21390#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21391#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 21392#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 21393#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21394#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21395#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 21396#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 21397#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 21398#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 21399#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 21400#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21401#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21402#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 21403#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21404#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 21405#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21406#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21407#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 21408#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 21409#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21410#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 21411#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 21412#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 21413#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21414#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 21415#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 21416#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21417#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 21418#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 21419#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21420#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 21421#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21422#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21423#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 21424#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21425#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21426#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21427#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 21429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 21430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32727) ~n)), 21431#(and (<= (+ foo_~i~0 32726) ~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) 130904) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:34,147 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-04 02:05:34,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 02:05:34,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 02:05:34,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=1485, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:05:34,147 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 50 states. [2018-02-04 02:05:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:35,922 INFO L93 Difference]: Finished difference Result 557 states and 601 transitions. [2018-02-04 02:05:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 02:05:35,923 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 185 [2018-02-04 02:05:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:35,924 INFO L225 Difference]: With dead ends: 557 [2018-02-04 02:05:35,924 INFO L226 Difference]: Without dead ends: 557 [2018-02-04 02:05:35,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2985, Invalid=5571, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 02:05:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-04 02:05:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 216. [2018-02-04 02:05:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 02:05:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-02-04 02:05:35,927 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 185 [2018-02-04 02:05:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:35,927 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-02-04 02:05:35,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 02:05:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-02-04 02:05:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 02:05:35,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:35,927 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-04 02:05:35,927 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1833675662, now seen corresponding path program 43 times [2018-02-04 02:05:35,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:35,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:37,149 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-04 02:05:37,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:37,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 02:05:37,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:37,150 INFO L182 omatonBuilderFactory]: Interpolants [22292#true, 22293#false, 22294#(<= 32768 ~n), 22295#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 22296#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22297#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 22299#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 22301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 22302#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22303#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22304#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 22305#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 22306#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 22307#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 22308#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 22309#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22310#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22311#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 22312#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22313#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 22314#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22315#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22316#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 22317#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 22318#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22319#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 22320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 22321#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 22322#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22323#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 22324#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 22325#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22326#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22327#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 22328#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22329#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 22330#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22331#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22332#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 22333#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22334#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22335#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22336#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 22338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 22339#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22340#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 22341#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 22342#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130900) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:37,151 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-04 02:05:37,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 02:05:37,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 02:05:37,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=1541, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:05:37,151 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 51 states. [2018-02-04 02:05:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:39,144 INFO L93 Difference]: Finished difference Result 569 states and 614 transitions. [2018-02-04 02:05:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 02:05:39,144 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 189 [2018-02-04 02:05:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:39,145 INFO L225 Difference]: With dead ends: 569 [2018-02-04 02:05:39,146 INFO L226 Difference]: Without dead ends: 569 [2018-02-04 02:05:39,146 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-04 02:05:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-02-04 02:05:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 220. [2018-02-04 02:05:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 02:05:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-02-04 02:05:39,148 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 189 [2018-02-04 02:05:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:39,149 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-02-04 02:05:39,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 02:05:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-02-04 02:05:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 02:05:39,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:39,149 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-04 02:05:39,149 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1097074103, now seen corresponding path program 44 times [2018-02-04 02:05:39,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:39,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:40,633 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-04 02:05:40,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:40,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 02:05:40,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:40,633 INFO L182 omatonBuilderFactory]: Interpolants [23220#true, 23221#false, 23222#(<= 32768 ~n), 23223#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 23224#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23225#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23226#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 23227#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23228#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 23229#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 23230#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23231#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 23233#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 23234#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 23235#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 23236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 23237#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23238#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23239#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 23240#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 23242#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23243#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23244#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 23245#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 23246#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23247#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 23248#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 23249#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 23250#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23251#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 23252#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 23253#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23254#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 23255#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 23256#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23257#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 23258#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23259#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23260#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 23261#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23262#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23263#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23264#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23265#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 23266#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 23267#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23268#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 23269#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 23270#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 23271#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130896) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:40,634 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-04 02:05:40,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 02:05:40,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 02:05:40,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=1598, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 02:05:40,634 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 52 states. [2018-02-04 02:05:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:42,599 INFO L93 Difference]: Finished difference Result 581 states and 627 transitions. [2018-02-04 02:05:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 02:05:42,599 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 193 [2018-02-04 02:05:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:42,600 INFO L225 Difference]: With dead ends: 581 [2018-02-04 02:05:42,600 INFO L226 Difference]: Without dead ends: 581 [2018-02-04 02:05:42,601 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-04 02:05:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-02-04 02:05:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 224. [2018-02-04 02:05:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 02:05:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-02-04 02:05:42,603 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 193 [2018-02-04 02:05:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:42,604 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-02-04 02:05:42,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 02:05:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-02-04 02:05:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 02:05:42,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:42,604 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-04 02:05:42,604 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1073816416, now seen corresponding path program 45 times [2018-02-04 02:05:42,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:42,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:44,024 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-04 02:05:44,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:44,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 02:05:44,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:44,025 INFO L182 omatonBuilderFactory]: Interpolants [24192#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 24193#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24194#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 24195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 24196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 24197#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24198#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 24199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 24200#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24201#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 24203#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 24205#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24206#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 24208#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24209#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24210#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24211#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 24213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 24214#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 24216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 24217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 24218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24219#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130892) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24167#true, 24168#false, 24169#(<= 32768 ~n), 24170#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 24171#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24172#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24173#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 24174#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24175#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 24176#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 24177#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24178#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 24180#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 24181#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 24182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 24183#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 24184#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24185#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24186#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 24187#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24188#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 24189#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24190#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24191#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n))] [2018-02-04 02:05:44,025 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-04 02:05:44,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 02:05:44,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 02:05:44,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=1656, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 02:05:44,026 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 53 states. [2018-02-04 02:05:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:45,967 INFO L93 Difference]: Finished difference Result 593 states and 640 transitions. [2018-02-04 02:05:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 02:05:45,967 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 197 [2018-02-04 02:05:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:45,969 INFO L225 Difference]: With dead ends: 593 [2018-02-04 02:05:45,969 INFO L226 Difference]: Without dead ends: 593 [2018-02-04 02:05:45,969 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-04 02:05:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-04 02:05:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 228. [2018-02-04 02:05:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 02:05:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-02-04 02:05:45,973 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 197 [2018-02-04 02:05:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:45,974 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-02-04 02:05:45,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 02:05:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-02-04 02:05:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 02:05:45,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:45,975 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-04 02:05:45,975 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1242907785, now seen corresponding path program 46 times [2018-02-04 02:05:45,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:46,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:47,488 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-04 02:05:47,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:47,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 02:05:47,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:47,512 INFO L182 omatonBuilderFactory]: Interpolants [25133#true, 25134#false, 25135#(<= 32768 ~n), 25136#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 25137#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25138#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25139#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 25140#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 25142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 25143#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25144#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 25146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 25147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 25148#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 25149#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 25150#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25151#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 25153#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 25155#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25156#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 25158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 25159#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25160#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 25161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 25162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 25163#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25164#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 25165#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 25166#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 25168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 25169#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25170#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 25171#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25172#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25173#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 25174#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25175#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25176#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25177#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25178#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 25179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 25180#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25181#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 25182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 25183#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 25184#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 25185#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 25186#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130888) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:47,513 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-04 02:05:47,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 02:05:47,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 02:05:47,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=1715, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 02:05:47,513 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 54 states. [2018-02-04 02:05:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:49,621 INFO L93 Difference]: Finished difference Result 605 states and 653 transitions. [2018-02-04 02:05:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 02:05:49,621 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 201 [2018-02-04 02:05:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:49,622 INFO L225 Difference]: With dead ends: 605 [2018-02-04 02:05:49,622 INFO L226 Difference]: Without dead ends: 605 [2018-02-04 02:05:49,623 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-04 02:05:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-04 02:05:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 232. [2018-02-04 02:05:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 02:05:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-02-04 02:05:49,625 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 201 [2018-02-04 02:05:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:49,625 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-02-04 02:05:49,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 02:05:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-02-04 02:05:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 02:05:49,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:49,626 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-04 02:05:49,626 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash 42817230, now seen corresponding path program 47 times [2018-02-04 02:05:49,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:49,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:51,203 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-04 02:05:51,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:51,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 02:05:51,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:51,203 INFO L182 omatonBuilderFactory]: Interpolants [26118#true, 26119#false, 26120#(<= 32768 ~n), 26121#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 26122#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26123#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26124#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 26125#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26126#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 26127#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 26128#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26129#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 26131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 26132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 26133#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 26134#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 26135#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26136#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26137#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 26138#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26139#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 26140#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26141#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 26143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 26144#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 26146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 26147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 26148#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26149#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 26150#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 26151#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26152#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26153#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 26154#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 26156#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26157#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 26159#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26160#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26161#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26162#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26163#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 26164#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 26165#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26166#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 26167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 26168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 26169#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26170#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 26171#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 26172#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130884) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:05:51,204 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-04 02:05:51,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 02:05:51,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 02:05:51,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=1775, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 02:05:51,204 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 55 states. [2018-02-04 02:05:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:53,385 INFO L93 Difference]: Finished difference Result 617 states and 666 transitions. [2018-02-04 02:05:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 02:05:53,385 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 205 [2018-02-04 02:05:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:53,386 INFO L225 Difference]: With dead ends: 617 [2018-02-04 02:05:53,386 INFO L226 Difference]: Without dead ends: 617 [2018-02-04 02:05:53,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3690, Invalid=6816, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 02:05:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-02-04 02:05:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 236. [2018-02-04 02:05:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 02:05:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-02-04 02:05:53,390 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 205 [2018-02-04 02:05:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:53,390 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-02-04 02:05:53,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 02:05:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-02-04 02:05:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 02:05:53,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:53,391 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-04 02:05:53,391 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1154191707, now seen corresponding path program 48 times [2018-02-04 02:05:53,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:53,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:55,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:55,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 02:05:55,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:55,010 INFO L182 omatonBuilderFactory]: Interpolants [27136#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 27137#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 27138#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 27139#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27140#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 27142#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 27144#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27145#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 27147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 27148#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27149#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 27150#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 27151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 27152#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27153#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 27154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 27155#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 27157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 27158#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27159#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 27160#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27161#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 27163#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27164#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27165#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27166#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 27168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 27169#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27170#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 27171#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 27172#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 27173#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27174#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 27175#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 27176#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 27177#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130880) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 27122#true, 27123#false, 27124#(<= 32768 ~n), 27125#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 27126#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27127#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27128#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 27129#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 27131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 27132#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27133#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27134#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 27135#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n))] [2018-02-04 02:05:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:55,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 02:05:55,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 02:05:55,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1244, Invalid=1836, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 02:05:55,011 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 56 states. [2018-02-04 02:05:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:05:57,347 INFO L93 Difference]: Finished difference Result 629 states and 679 transitions. [2018-02-04 02:05:57,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 02:05:57,348 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 209 [2018-02-04 02:05:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:05:57,349 INFO L225 Difference]: With dead ends: 629 [2018-02-04 02:05:57,349 INFO L226 Difference]: Without dead ends: 629 [2018-02-04 02:05:57,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3840, Invalid=7080, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 02:05:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-04 02:05:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 240. [2018-02-04 02:05:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 02:05:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2018-02-04 02:05:57,352 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 209 [2018-02-04 02:05:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:05:57,352 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2018-02-04 02:05:57,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 02:05:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2018-02-04 02:05:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 02:05:57,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:05:57,353 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:05:57,353 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:05:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 407749372, now seen corresponding path program 49 times [2018-02-04 02:05:57,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:05:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:05:57,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:05:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:58,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:05:58,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 02:05:58,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:05:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:58,974 INFO L182 omatonBuilderFactory]: Interpolants [28160#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 28161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 28162#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28163#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28164#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 28165#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28166#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 28167#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28168#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28169#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 28170#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 28171#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28172#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 28173#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 28174#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 28175#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28176#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 28177#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 28178#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 28180#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 28181#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 28183#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28184#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28185#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 28186#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28187#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28188#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28189#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28190#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 28191#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 28192#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28193#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 28194#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 28195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 28196#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28197#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 28198#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28199#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 28200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 28201#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130876) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 28145#true, 28146#false, 28147#(<= 32768 ~n), 28148#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 28149#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28150#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 28152#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28153#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 28154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 28155#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28156#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 28158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 28159#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n))] [2018-02-04 02:05:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:05:58,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 02:05:58,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 02:05:58,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=1898, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 02:05:58,975 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 57 states. [2018-02-04 02:06:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:01,409 INFO L93 Difference]: Finished difference Result 641 states and 692 transitions. [2018-02-04 02:06:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 02:06:01,409 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 213 [2018-02-04 02:06:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:01,410 INFO L225 Difference]: With dead ends: 641 [2018-02-04 02:06:01,411 INFO L226 Difference]: Without dead ends: 641 [2018-02-04 02:06:01,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3993, Invalid=7349, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 02:06:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-04 02:06:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 244. [2018-02-04 02:06:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 02:06:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 246 transitions. [2018-02-04 02:06:01,414 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 246 transitions. Word has length 213 [2018-02-04 02:06:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:01,414 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 246 transitions. [2018-02-04 02:06:01,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 02:06:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 246 transitions. [2018-02-04 02:06:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 02:06:01,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:01,415 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:01,415 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash -446229549, now seen corresponding path program 50 times [2018-02-04 02:06:01,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:01,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:03,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:03,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 02:06:03,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:03,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-04 02:06:03,200 INFO L182 omatonBuilderFactory]: Interpolants [29187#true, 29188#false, 29189#(<= 32768 ~n), 29190#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 29191#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29192#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29193#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 29194#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 29196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 29197#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29198#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 29200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 29201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 29202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 29203#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 29204#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29205#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 29207#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29208#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 29209#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29210#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29211#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 29212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 29213#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 29215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 29216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 29217#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 29219#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 29220#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 29222#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 29223#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29224#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 29225#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29226#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29227#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 29228#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29229#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29230#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29231#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 29233#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 29234#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29235#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 29236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 29237#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 29238#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29239#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 29240#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 29242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 29243#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 29244#(and (<= (+ (* 4 foo_~i~0) 130872) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:06:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:03,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 02:06:03,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 02:06:03,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1345, Invalid=1961, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:06:03,201 INFO L87 Difference]: Start difference. First operand 244 states and 246 transitions. Second operand 58 states. [2018-02-04 02:06:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:05,619 INFO L93 Difference]: Finished difference Result 653 states and 705 transitions. [2018-02-04 02:06:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 02:06:05,620 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 217 [2018-02-04 02:06:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:05,621 INFO L225 Difference]: With dead ends: 653 [2018-02-04 02:06:05,621 INFO L226 Difference]: Without dead ends: 653 [2018-02-04 02:06:05,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4149, Invalid=7623, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 02:06:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-02-04 02:06:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 248. [2018-02-04 02:06:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 02:06:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2018-02-04 02:06:05,626 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 217 [2018-02-04 02:06:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:05,627 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2018-02-04 02:06:05,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 02:06:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2018-02-04 02:06:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-02-04 02:06:05,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:05,628 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:05,628 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:05,628 INFO L82 PathProgramCache]: Analyzing trace with hash -248635094, now seen corresponding path program 51 times [2018-02-04 02:06:05,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:05,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:07,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:07,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 02:06:07,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:07,381 INFO L182 omatonBuilderFactory]: Interpolants [30248#true, 30249#false, 30250#(<= 32768 ~n), 30251#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 30252#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30253#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30254#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 30255#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30256#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 30257#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 30258#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30259#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30260#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 30261#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 30262#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 30263#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 30264#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 30265#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30266#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30267#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 30268#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30269#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 30270#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30271#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30272#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 30273#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 30274#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30275#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 30276#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 30277#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 30278#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 30280#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 30281#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30282#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 30283#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 30284#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30285#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 30286#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30287#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30288#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 30289#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30290#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30291#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30292#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30293#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 30294#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 30295#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30296#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 30297#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 30298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 30299#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 30301#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 30303#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30304#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 30305#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 30306#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130868) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:06:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:07,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 02:06:07,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 02:06:07,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2025, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 02:06:07,381 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 59 states. [2018-02-04 02:06:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:09,852 INFO L93 Difference]: Finished difference Result 665 states and 718 transitions. [2018-02-04 02:06:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 02:06:09,853 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 221 [2018-02-04 02:06:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:09,854 INFO L225 Difference]: With dead ends: 665 [2018-02-04 02:06:09,854 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 02:06:09,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4308, Invalid=7902, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 02:06:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 02:06:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 252. [2018-02-04 02:06:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 02:06:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-02-04 02:06:09,857 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 221 [2018-02-04 02:06:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:09,857 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-02-04 02:06:09,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 02:06:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-02-04 02:06:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 02:06:09,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:09,858 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:09,858 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2104535809, now seen corresponding path program 52 times [2018-02-04 02:06:09,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:09,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:11,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:11,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 02:06:11,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:11,737 INFO L182 omatonBuilderFactory]: Interpolants [31360#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 31361#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31362#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 31363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 31364#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31365#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 31366#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31367#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31368#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 31369#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31370#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31371#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31372#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31373#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 31374#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 31375#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31376#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 31377#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 31378#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 31379#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31380#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 31381#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31382#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 31383#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31384#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31385#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 31386#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 31387#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130864) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 31328#true, 31329#false, 31330#(<= 32768 ~n), 31331#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 31332#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31333#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31334#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 31335#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 31337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 31338#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31339#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31340#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 31341#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 31342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 31343#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 31344#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 31345#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31346#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31347#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 31348#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 31350#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31351#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31352#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 31353#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 31354#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31355#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 31356#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 31357#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 31358#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31359#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n))] [2018-02-04 02:06:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:11,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 02:06:11,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 02:06:11,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1450, Invalid=2090, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 02:06:11,738 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 60 states. [2018-02-04 02:06:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:14,155 INFO L93 Difference]: Finished difference Result 677 states and 731 transitions. [2018-02-04 02:06:14,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 02:06:14,155 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 225 [2018-02-04 02:06:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:14,156 INFO L225 Difference]: With dead ends: 677 [2018-02-04 02:06:14,157 INFO L226 Difference]: Without dead ends: 677 [2018-02-04 02:06:14,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4470, Invalid=8186, Unknown=0, NotChecked=0, Total=12656 [2018-02-04 02:06:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-02-04 02:06:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 256. [2018-02-04 02:06:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 02:06:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 258 transitions. [2018-02-04 02:06:14,160 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 258 transitions. Word has length 225 [2018-02-04 02:06:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:14,161 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 258 transitions. [2018-02-04 02:06:14,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 02:06:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 258 transitions. [2018-02-04 02:06:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-04 02:06:14,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:14,162 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:14,162 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1357090472, now seen corresponding path program 53 times [2018-02-04 02:06:14,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:14,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:16,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:16,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 02:06:16,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:16,015 INFO L182 omatonBuilderFactory]: Interpolants [32427#true, 32428#false, 32429#(<= 32768 ~n), 32430#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 32431#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32432#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32433#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 32434#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32435#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 32436#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 32437#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32438#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32439#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 32440#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 32441#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 32442#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 32443#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 32444#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32445#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32446#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 32447#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 32449#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32450#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 32452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 32453#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32454#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 32455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 32456#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 32457#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32458#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 32459#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 32460#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32461#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 32462#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 32463#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32464#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 32465#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32466#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32467#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 32468#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32469#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32470#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32471#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 32473#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 32474#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32475#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 32476#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 32477#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 32478#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32479#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 32480#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32481#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 32482#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32483#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32484#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32485#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 32486#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32715) ~n)), 32487#(and (<= (+ (* 4 foo_~i~0) 130860) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:06:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:16,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 02:06:16,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 02:06:16,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1504, Invalid=2156, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 02:06:16,016 INFO L87 Difference]: Start difference. First operand 256 states and 258 transitions. Second operand 61 states. [2018-02-04 02:06:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:18,593 INFO L93 Difference]: Finished difference Result 689 states and 744 transitions. [2018-02-04 02:06:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 02:06:18,593 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 229 [2018-02-04 02:06:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:18,595 INFO L225 Difference]: With dead ends: 689 [2018-02-04 02:06:18,595 INFO L226 Difference]: Without dead ends: 689 [2018-02-04 02:06:18,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4635, Invalid=8475, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 02:06:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-02-04 02:06:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 260. [2018-02-04 02:06:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 02:06:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 262 transitions. [2018-02-04 02:06:18,599 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 262 transitions. Word has length 229 [2018-02-04 02:06:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:18,599 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 262 transitions. [2018-02-04 02:06:18,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 02:06:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 262 transitions. [2018-02-04 02:06:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 02:06:18,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:18,600 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:18,600 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash -29412305, now seen corresponding path program 54 times [2018-02-04 02:06:18,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:18,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:20,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:20,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 02:06:20,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:20,501 INFO L182 omatonBuilderFactory]: Interpolants [33545#true, 33546#false, 33547#(<= 32768 ~n), 33548#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 33549#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33550#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33551#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 33552#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33553#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 33554#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 33555#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33556#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33557#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 33558#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 33559#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 33560#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 33561#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 33562#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33563#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33564#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 33565#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33566#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 33567#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33568#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33569#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 33570#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 33571#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33572#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 33573#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 33574#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 33575#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33576#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 33577#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 33578#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33579#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33580#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 33581#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33582#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 33583#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33584#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33585#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 33586#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33587#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33588#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33589#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33590#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 33591#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 33592#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33593#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 33594#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 33595#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 33596#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33597#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 33598#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33599#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 33600#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33601#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33602#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33603#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 33604#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32715) ~n)), 33605#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 33606#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130856) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:06:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:20,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 02:06:20,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 02:06:20,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=2223, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:06:20,502 INFO L87 Difference]: Start difference. First operand 260 states and 262 transitions. Second operand 62 states. [2018-02-04 02:06:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:23,360 INFO L93 Difference]: Finished difference Result 701 states and 757 transitions. [2018-02-04 02:06:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 02:06:23,385 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 233 [2018-02-04 02:06:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:23,387 INFO L225 Difference]: With dead ends: 701 [2018-02-04 02:06:23,387 INFO L226 Difference]: Without dead ends: 701 [2018-02-04 02:06:23,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4803, Invalid=8769, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 02:06:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-04 02:06:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 264. [2018-02-04 02:06:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 02:06:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 266 transitions. [2018-02-04 02:06:23,391 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 266 transitions. Word has length 233 [2018-02-04 02:06:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:23,391 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 266 transitions. [2018-02-04 02:06:23,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 02:06:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 266 transitions. [2018-02-04 02:06:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 02:06:23,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:23,392 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:23,392 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1509510266, now seen corresponding path program 55 times [2018-02-04 02:06:23,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:23,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:25,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:25,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 02:06:25,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:25,371 INFO L182 omatonBuilderFactory]: Interpolants [34688#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 34689#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34690#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 34691#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 34692#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34693#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34694#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 34695#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 34696#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 34697#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 34698#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 34699#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34700#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34701#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 34702#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34703#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 34704#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34705#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34706#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 34707#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 34708#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34709#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 34710#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 34711#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 34712#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34713#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 34714#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 34715#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34716#(and (= ~a.offset 0) (<= (+ foo_~i~0 32739) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34717#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 34718#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34719#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 34720#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34721#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34722#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 34723#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34724#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34725#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34726#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34727#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 34728#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 34729#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34730#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 34731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 34732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 34733#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 34735#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34736#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 34737#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34738#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34739#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34740#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 34741#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34742#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 34743#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 34744#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130852) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 34682#true, 34683#false, 34684#(<= 32768 ~n), 34685#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 34686#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34687#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:06:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:25,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 02:06:25,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 02:06:25,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1615, Invalid=2291, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 02:06:25,372 INFO L87 Difference]: Start difference. First operand 264 states and 266 transitions. Second operand 63 states. [2018-02-04 02:06:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:28,227 INFO L93 Difference]: Finished difference Result 713 states and 770 transitions. [2018-02-04 02:06:28,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 02:06:28,228 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 237 [2018-02-04 02:06:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:28,229 INFO L225 Difference]: With dead ends: 713 [2018-02-04 02:06:28,229 INFO L226 Difference]: Without dead ends: 713 [2018-02-04 02:06:28,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4974, Invalid=9068, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 02:06:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-02-04 02:06:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 268. [2018-02-04 02:06:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 02:06:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 270 transitions. [2018-02-04 02:06:28,232 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 270 transitions. Word has length 237 [2018-02-04 02:06:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:28,232 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 270 transitions. [2018-02-04 02:06:28,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 02:06:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 270 transitions. [2018-02-04 02:06:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-04 02:06:28,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:28,233 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:28,233 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash 348172125, now seen corresponding path program 56 times [2018-02-04 02:06:28,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:28,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:30,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:30,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 02:06:30,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:30,352 INFO L182 omatonBuilderFactory]: Interpolants [35840#(<= 32768 ~n), 35841#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 35842#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35843#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35844#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 35845#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35846#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 35847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 35848#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35849#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35850#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 35851#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 35852#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 35853#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 35854#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 35855#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35856#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35857#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 35858#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35859#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 35860#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35861#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35862#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 35863#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 35864#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35865#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 35866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 35867#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 35868#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35869#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 35870#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 35871#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35872#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 35873#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 35874#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35875#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 35876#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35877#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35878#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 35879#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35880#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35881#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35882#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35883#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 35884#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 35885#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35886#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 35887#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 35888#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 35889#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35890#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 35891#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35892#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 35893#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35894#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35895#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35896#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 35897#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35898#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 35899#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 35900#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 35901#(and (<= (+ (* 4 foo_~i~0) 130848) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 35838#true, 35839#false] [2018-02-04 02:06:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:30,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 02:06:30,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 02:06:30,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1672, Invalid=2360, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 02:06:30,353 INFO L87 Difference]: Start difference. First operand 268 states and 270 transitions. Second operand 64 states. [2018-02-04 02:06:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:33,283 INFO L93 Difference]: Finished difference Result 725 states and 783 transitions. [2018-02-04 02:06:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 02:06:33,284 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 241 [2018-02-04 02:06:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:33,285 INFO L225 Difference]: With dead ends: 725 [2018-02-04 02:06:33,285 INFO L226 Difference]: Without dead ends: 725 [2018-02-04 02:06:33,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5148, Invalid=9372, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 02:06:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-02-04 02:06:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 272. [2018-02-04 02:06:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 02:06:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 274 transitions. [2018-02-04 02:06:33,290 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 274 transitions. Word has length 241 [2018-02-04 02:06:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:33,290 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 274 transitions. [2018-02-04 02:06:33,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 02:06:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 274 transitions. [2018-02-04 02:06:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 02:06:33,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:33,291 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:33,291 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1541072820, now seen corresponding path program 57 times [2018-02-04 02:06:33,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:33,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:35,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:35,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 02:06:35,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:35,482 INFO L182 omatonBuilderFactory]: Interpolants [37013#true, 37014#false, 37015#(<= 32768 ~n), 37016#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 37017#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37018#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37019#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 37020#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37021#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 37022#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 37023#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37024#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37025#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 37026#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 37027#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 37028#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 37029#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 37030#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37031#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37032#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 37033#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37034#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 37035#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37036#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37037#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 37038#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 37039#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37040#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 37041#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 37042#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 37043#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37044#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 37045#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 37046#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37047#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 37048#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 37049#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37050#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 37051#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37052#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 37054#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37055#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37056#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37057#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37058#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 37059#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 37060#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37061#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 37062#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 37063#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 37064#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37065#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 37066#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37067#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 37068#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37069#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37070#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37071#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 37072#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37073#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 37074#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37075#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 37076#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 37077#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130844) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:06:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:35,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 02:06:35,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 02:06:35,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1730, Invalid=2430, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 02:06:35,483 INFO L87 Difference]: Start difference. First operand 272 states and 274 transitions. Second operand 65 states. [2018-02-04 02:06:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:38,617 INFO L93 Difference]: Finished difference Result 737 states and 796 transitions. [2018-02-04 02:06:38,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 02:06:38,617 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 245 [2018-02-04 02:06:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:38,619 INFO L225 Difference]: With dead ends: 737 [2018-02-04 02:06:38,619 INFO L226 Difference]: Without dead ends: 737 [2018-02-04 02:06:38,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5325, Invalid=9681, Unknown=0, NotChecked=0, Total=15006 [2018-02-04 02:06:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-02-04 02:06:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 276. [2018-02-04 02:06:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 02:06:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-02-04 02:06:38,622 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 245 [2018-02-04 02:06:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:38,623 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-02-04 02:06:38,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 02:06:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-02-04 02:06:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 02:06:38,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:38,623 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:38,623 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1612505973, now seen corresponding path program 58 times [2018-02-04 02:06:38,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:38,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:40,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:40,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 02:06:40,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:40,843 INFO L182 omatonBuilderFactory]: Interpolants [38272#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 130840) (select |#length| ~a.base))), 38207#true, 38208#false, 38209#(<= 32768 ~n), 38210#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 38211#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38212#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 38214#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 38216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 38217#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38218#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38219#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 38220#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 38221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 38222#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 38223#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 38224#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38225#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38226#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 38227#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38228#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 38229#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38230#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 38232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 38233#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38234#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 38235#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 38236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 38237#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38238#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 38239#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 38240#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 38242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 38243#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38244#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 38245#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38246#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38247#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 38248#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38249#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38250#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38251#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38252#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 38253#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 38254#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38255#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 38256#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 38257#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 38258#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38259#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 38260#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38261#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 38262#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38263#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38264#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38265#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 38266#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38267#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 38268#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38269#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38270#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 38271#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32710) ~n))] [2018-02-04 02:06:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:40,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 02:06:40,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 02:06:40,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1789, Invalid=2501, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 02:06:40,844 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 66 states. [2018-02-04 02:06:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:44,060 INFO L93 Difference]: Finished difference Result 749 states and 809 transitions. [2018-02-04 02:06:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 02:06:44,060 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 249 [2018-02-04 02:06:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:44,062 INFO L225 Difference]: With dead ends: 749 [2018-02-04 02:06:44,062 INFO L226 Difference]: Without dead ends: 749 [2018-02-04 02:06:44,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5505, Invalid=9995, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 02:06:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-02-04 02:06:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 280. [2018-02-04 02:06:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-04 02:06:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2018-02-04 02:06:44,066 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 249 [2018-02-04 02:06:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:44,067 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2018-02-04 02:06:44,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 02:06:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2018-02-04 02:06:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 02:06:44,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:44,067 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:44,067 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2004415006, now seen corresponding path program 59 times [2018-02-04 02:06:44,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:44,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:46,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:46,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 02:06:46,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:46,402 INFO L182 omatonBuilderFactory]: Interpolants [39424#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39425#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39426#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 39427#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 39429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 39430#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39431#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 39433#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 39434#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 39435#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 39436#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 39437#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39438#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39439#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 39440#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39441#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 39442#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39443#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39444#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 39445#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 39446#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39447#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 39448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 39449#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 39450#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 39452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 39453#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39454#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 39455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 39456#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39457#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 39458#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39459#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39460#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 39461#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39462#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39463#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39464#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39465#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 39466#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 39467#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39468#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 39469#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 39470#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 39471#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 39473#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39474#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 39475#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39476#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39477#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39478#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 39479#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39480#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 39481#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39482#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39483#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 39484#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32710) ~n)), 39485#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32709) ~n)), 39486#(and (<= (+ (* 4 foo_~i~0) 130836) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 39420#true, 39421#false, 39422#(<= 32768 ~n), 39423#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|))] [2018-02-04 02:06:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:46,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 02:06:46,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 02:06:46,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1849, Invalid=2573, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 02:06:46,403 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 67 states. [2018-02-04 02:06:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:49,627 INFO L93 Difference]: Finished difference Result 761 states and 822 transitions. [2018-02-04 02:06:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 02:06:49,628 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 253 [2018-02-04 02:06:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:49,629 INFO L225 Difference]: With dead ends: 761 [2018-02-04 02:06:49,629 INFO L226 Difference]: Without dead ends: 761 [2018-02-04 02:06:49,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5688, Invalid=10314, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 02:06:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-02-04 02:06:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 284. [2018-02-04 02:06:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 02:06:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 286 transitions. [2018-02-04 02:06:49,633 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 286 transitions. Word has length 253 [2018-02-04 02:06:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:49,633 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 286 transitions. [2018-02-04 02:06:49,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 02:06:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 286 transitions. [2018-02-04 02:06:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 02:06:49,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:49,633 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:49,633 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:49,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1332446279, now seen corresponding path program 60 times [2018-02-04 02:06:49,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:49,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:52,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:52,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 02:06:52,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:52,029 INFO L182 omatonBuilderFactory]: Interpolants [40704#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 40705#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40706#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 40707#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40708#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40709#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40710#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 40711#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40712#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 40713#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40714#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40715#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 40716#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 40717#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 32709) ~n)), 40718#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 40719#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130832) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 40652#true, 40653#false, 40654#(<= 32768 ~n), 40655#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 40656#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40657#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40658#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 40659#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 40661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 40662#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40663#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40664#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 40665#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 40666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 40667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 40668#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 40669#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40670#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40671#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 40672#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 40674#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40675#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40676#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 40677#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 40678#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40679#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 40680#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 40681#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 40682#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40683#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 40684#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 40685#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40686#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 40687#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 40688#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40689#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 40690#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40691#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40692#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 40693#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40694#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40695#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40696#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40697#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 40698#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 40699#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40700#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 40701#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 40702#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 40703#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:06:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:52,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 02:06:52,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 02:06:52,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1910, Invalid=2646, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 02:06:52,030 INFO L87 Difference]: Start difference. First operand 284 states and 286 transitions. Second operand 68 states. [2018-02-04 02:06:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:06:55,180 INFO L93 Difference]: Finished difference Result 773 states and 835 transitions. [2018-02-04 02:06:55,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 02:06:55,193 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 257 [2018-02-04 02:06:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:06:55,195 INFO L225 Difference]: With dead ends: 773 [2018-02-04 02:06:55,195 INFO L226 Difference]: Without dead ends: 773 [2018-02-04 02:06:55,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5874, Invalid=10638, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 02:06:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-02-04 02:06:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 288. [2018-02-04 02:06:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 02:06:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 290 transitions. [2018-02-04 02:06:55,199 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 290 transitions. Word has length 257 [2018-02-04 02:06:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:06:55,199 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 290 transitions. [2018-02-04 02:06:55,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 02:06:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 290 transitions. [2018-02-04 02:06:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-02-04 02:06:55,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:06:55,200 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:06:55,200 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:06:55,200 INFO L82 PathProgramCache]: Analyzing trace with hash 368649744, now seen corresponding path program 61 times [2018-02-04 02:06:55,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:06:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:06:55,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:06:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:57,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:06:57,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 02:06:57,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:06:57,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-04 02:06:57,588 INFO L182 omatonBuilderFactory]: Interpolants [41903#true, 41904#false, 41905#(<= 32768 ~n), 41906#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 41907#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41908#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41909#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 41910#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41911#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 41912#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 41913#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41914#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41915#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 41916#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 41917#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 41918#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 41919#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 41920#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41921#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41922#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 41923#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41924#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 41925#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41926#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41927#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 41928#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 41929#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41930#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 41931#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 41932#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 41933#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41934#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 41935#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 41936#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41937#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 41938#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 41939#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41940#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 41941#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41942#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41943#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 41944#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41945#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41946#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41947#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41948#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 41949#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 41950#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41951#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 41952#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 41953#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 41954#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41955#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 41956#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41957#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 41958#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41959#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41960#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41961#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 41962#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41963#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 41964#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41965#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 41967#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 41968#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 41969#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 41970#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 41971#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130828) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:06:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:06:57,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 02:06:57,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 02:06:57,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1972, Invalid=2720, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 02:06:57,589 INFO L87 Difference]: Start difference. First operand 288 states and 290 transitions. Second operand 69 states. [2018-02-04 02:07:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:00,957 INFO L93 Difference]: Finished difference Result 785 states and 848 transitions. [2018-02-04 02:07:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 02:07:00,957 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 261 [2018-02-04 02:07:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:00,959 INFO L225 Difference]: With dead ends: 785 [2018-02-04 02:07:00,959 INFO L226 Difference]: Without dead ends: 785 [2018-02-04 02:07:00,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6063, Invalid=10967, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 02:07:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-02-04 02:07:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 292. [2018-02-04 02:07:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 02:07:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 294 transitions. [2018-02-04 02:07:00,962 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 294 transitions. Word has length 261 [2018-02-04 02:07:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:00,963 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 294 transitions. [2018-02-04 02:07:00,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 02:07:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 294 transitions. [2018-02-04 02:07:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-02-04 02:07:00,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:00,964 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:00,964 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:07:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1983722265, now seen corresponding path program 62 times [2018-02-04 02:07:00,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:01,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:03,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:03,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 02:07:03,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:03,693 INFO L182 omatonBuilderFactory]: Interpolants [43173#true, 43174#false, 43175#(<= 32768 ~n), 43176#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 43177#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43178#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 43180#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43181#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 43182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 43183#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43184#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43185#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 43186#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 43187#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 43188#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 43189#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 43190#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43191#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43192#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 43193#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43194#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 43195#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43196#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43197#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 43198#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 43199#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 43201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 43202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 43203#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 43205#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 43206#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 43208#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 43209#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43210#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 43211#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43212#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 43214#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43215#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43216#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43217#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 43219#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 43220#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 43222#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 43223#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 43224#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43225#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 43226#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43227#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 43228#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43229#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43230#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 43232#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43233#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 43234#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43235#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 43237#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 43238#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 43239#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n)), 43240#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 43241#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 43242#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130824) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:07:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:03,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 02:07:03,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 02:07:03,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2035, Invalid=2795, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 02:07:03,694 INFO L87 Difference]: Start difference. First operand 292 states and 294 transitions. Second operand 70 states. [2018-02-04 02:07:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:07,309 INFO L93 Difference]: Finished difference Result 797 states and 861 transitions. [2018-02-04 02:07:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 02:07:07,309 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 265 [2018-02-04 02:07:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:07,311 INFO L225 Difference]: With dead ends: 797 [2018-02-04 02:07:07,311 INFO L226 Difference]: Without dead ends: 797 [2018-02-04 02:07:07,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6255, Invalid=11301, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 02:07:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-02-04 02:07:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 296. [2018-02-04 02:07:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 02:07:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 298 transitions. [2018-02-04 02:07:07,314 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 298 transitions. Word has length 265 [2018-02-04 02:07:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:07,315 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 298 transitions. [2018-02-04 02:07:07,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 02:07:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 298 transitions. [2018-02-04 02:07:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-02-04 02:07:07,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:07,315 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:07,315 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:07:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash 538914878, now seen corresponding path program 63 times [2018-02-04 02:07:07,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:07,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:09,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:09,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 02:07:09,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:09,925 INFO L182 omatonBuilderFactory]: Interpolants [44462#true, 44463#false, 44464#(<= 32768 ~n), 44465#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 44466#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44467#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44468#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 44469#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44470#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 44471#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 44472#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44473#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44474#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 44475#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 44476#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 44477#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 44478#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 44479#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44480#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44481#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 44482#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44483#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 44484#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44485#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44486#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 44487#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 44488#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44489#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 44490#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 44491#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 44492#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44493#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 44494#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 44495#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44496#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 44497#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 44498#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44499#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 44500#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44501#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44502#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 44503#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44504#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44505#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44506#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 44508#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 44509#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44510#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 44511#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 44512#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 44513#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44514#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 44515#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44516#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 44517#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44518#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44519#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44520#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 44521#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44522#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 44523#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44524#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44525#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 44526#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 44527#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 44528#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n)), 44529#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44530#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 44531#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32705) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 44532#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130820) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:07:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:09,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 02:07:09,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 02:07:09,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2099, Invalid=2871, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 02:07:09,926 INFO L87 Difference]: Start difference. First operand 296 states and 298 transitions. Second operand 71 states. [2018-02-04 02:07:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:13,568 INFO L93 Difference]: Finished difference Result 809 states and 874 transitions. [2018-02-04 02:07:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 02:07:13,569 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 269 [2018-02-04 02:07:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:13,570 INFO L225 Difference]: With dead ends: 809 [2018-02-04 02:07:13,570 INFO L226 Difference]: Without dead ends: 809 [2018-02-04 02:07:13,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6450, Invalid=11640, Unknown=0, NotChecked=0, Total=18090 [2018-02-04 02:07:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-02-04 02:07:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 300. [2018-02-04 02:07:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-04 02:07:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 302 transitions. [2018-02-04 02:07:13,574 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 302 transitions. Word has length 269 [2018-02-04 02:07:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:13,574 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 302 transitions. [2018-02-04 02:07:13,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 02:07:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 302 transitions. [2018-02-04 02:07:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-04 02:07:13,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:13,575 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:13,575 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:07:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1604579307, now seen corresponding path program 64 times [2018-02-04 02:07:13,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:13,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:16,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:16,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 02:07:16,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:16,206 INFO L182 omatonBuilderFactory]: Interpolants [45824#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 45825#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45826#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45827#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45828#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 45829#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45830#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 45831#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45832#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45833#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 45834#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 45835#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 45836#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n)), 45837#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45838#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32705) ~n)), 45839#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32705) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 45840#(and (<= (+ foo_~i~0 32704) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 45841#(and (<= (+ (* 4 foo_~i~0) 130816) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 45770#true, 45771#false, 45772#(<= 32768 ~n), 45773#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 45774#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45775#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45776#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 45777#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45778#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 45779#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 45780#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45781#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45782#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 45783#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 45784#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 45785#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 45786#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 45787#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45788#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45789#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 45790#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 45792#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45793#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45794#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 45795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 45796#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45797#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 45798#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 45799#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 45800#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45801#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 45802#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 45803#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 45805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 45806#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45807#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 45808#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45809#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45810#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 45811#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45812#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45813#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45814#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45815#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 45816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 45817#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45818#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 45819#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 45820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 45821#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45822#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 45823#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 02:07:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:16,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 02:07:16,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 02:07:16,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=2948, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 02:07:16,206 INFO L87 Difference]: Start difference. First operand 300 states and 302 transitions. Second operand 72 states. [2018-02-04 02:07:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:19,659 INFO L93 Difference]: Finished difference Result 821 states and 887 transitions. [2018-02-04 02:07:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 02:07:19,659 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 273 [2018-02-04 02:07:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:19,661 INFO L225 Difference]: With dead ends: 821 [2018-02-04 02:07:19,661 INFO L226 Difference]: Without dead ends: 821 [2018-02-04 02:07:19,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6648, Invalid=11984, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 02:07:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-02-04 02:07:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 304. [2018-02-04 02:07:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-04 02:07:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2018-02-04 02:07:19,664 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 273 [2018-02-04 02:07:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:19,664 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2018-02-04 02:07:19,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 02:07:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2018-02-04 02:07:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 02:07:19,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:19,665 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:19,665 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:07:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash -186176404, now seen corresponding path program 65 times [2018-02-04 02:07:19,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:19,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:22,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:22,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 02:07:22,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:22,421 INFO L182 omatonBuilderFactory]: Interpolants [47104#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47105#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 47106#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 47107#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47108#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47109#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 47110#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 47111#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 47112#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 47113#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 47114#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47115#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47116#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 47117#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47118#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 47119#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47120#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47121#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 47122#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 47123#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47124#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 47125#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 47126#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 47127#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47128#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 47129#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 47130#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 47132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 47133#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47134#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 47135#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47136#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47137#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 47138#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47139#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47140#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47141#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 47143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 47144#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 47146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 47147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 47148#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47149#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 47150#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 47152#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47153#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47154#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 47156#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 47158#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47159#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47160#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 47161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 47162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 47163#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n)), 47164#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47165#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32705) ~n)), 47166#(and (<= (+ foo_~i~0 32704) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47167#(and (<= (+ foo_~i~0 32704) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 47168#(and (<= (+ foo_~i~0 32703) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 47169#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130812) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 47097#true, 47098#false, 47099#(<= 32768 ~n), 47100#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 47101#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47102#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47103#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n))] [2018-02-04 02:07:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:22,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 02:07:22,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 02:07:22,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3026, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 02:07:22,422 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 73 states. [2018-02-04 02:07:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:26,185 INFO L93 Difference]: Finished difference Result 833 states and 900 transitions. [2018-02-04 02:07:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 02:07:26,185 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 277 [2018-02-04 02:07:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:26,187 INFO L225 Difference]: With dead ends: 833 [2018-02-04 02:07:26,187 INFO L226 Difference]: Without dead ends: 833 [2018-02-04 02:07:26,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6849, Invalid=12333, Unknown=0, NotChecked=0, Total=19182 [2018-02-04 02:07:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2018-02-04 02:07:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 308. [2018-02-04 02:07:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 02:07:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 310 transitions. [2018-02-04 02:07:26,191 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 310 transitions. Word has length 277 [2018-02-04 02:07:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:26,192 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 310 transitions. [2018-02-04 02:07:26,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 02:07:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 310 transitions. [2018-02-04 02:07:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-02-04 02:07:26,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:26,192 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:26,192 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:07:26,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1689369277, now seen corresponding path program 66 times [2018-02-04 02:07:26,193 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:26,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:28,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:28,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 02:07:28,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:28,923 INFO L182 omatonBuilderFactory]: Interpolants [48512#(and (<= (+ foo_~i~0 32704) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48513#(and (<= (+ foo_~i~0 32703) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48514#(and (<= (+ foo_~i~0 32703) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 48515#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32702) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 48516#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130808) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 48443#true, 48444#false, 48445#(<= 32768 ~n), 48446#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 48447#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48448#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48449#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 48450#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 48452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 48453#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48454#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 48456#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 48457#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 48458#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 48459#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 48460#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48461#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48462#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 48463#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48464#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 48465#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48466#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48467#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 48468#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 48469#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48470#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 48471#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 48472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 48473#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48474#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 48475#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 48476#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48477#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 48478#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 48479#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48480#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 48481#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48482#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48483#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 48484#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48485#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48486#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48487#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48488#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 48489#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 48490#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48491#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 48492#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 48493#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 48494#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48495#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 48496#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48497#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 48498#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48499#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48500#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48501#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 48502#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48503#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 48504#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48505#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48506#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 48507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 48508#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 48509#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n)), 48510#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48511#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32705) ~n))] [2018-02-04 02:07:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:28,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 02:07:28,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 02:07:28,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2297, Invalid=3105, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 02:07:28,923 INFO L87 Difference]: Start difference. First operand 308 states and 310 transitions. Second operand 74 states. [2018-02-04 02:07:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:32,378 INFO L93 Difference]: Finished difference Result 845 states and 913 transitions. [2018-02-04 02:07:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 02:07:32,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 281 [2018-02-04 02:07:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:32,379 INFO L225 Difference]: With dead ends: 845 [2018-02-04 02:07:32,380 INFO L226 Difference]: Without dead ends: 845 [2018-02-04 02:07:32,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7053, Invalid=12687, Unknown=0, NotChecked=0, Total=19740 [2018-02-04 02:07:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-02-04 02:07:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 312. [2018-02-04 02:07:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 02:07:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 314 transitions. [2018-02-04 02:07:32,384 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 314 transitions. Word has length 281 [2018-02-04 02:07:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:32,384 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 314 transitions. [2018-02-04 02:07:32,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 02:07:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 314 transitions. [2018-02-04 02:07:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-04 02:07:32,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:32,385 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:32,385 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:07:32,385 INFO L82 PathProgramCache]: Analyzing trace with hash 339679898, now seen corresponding path program 67 times [2018-02-04 02:07:32,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:32,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:35,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:35,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 02:07:35,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:35,233 INFO L182 omatonBuilderFactory]: Interpolants [49808#true, 49809#false, 49810#(<= 32768 ~n), 49811#(and (<= 32768 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 49812#(and (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49813#(and (= foo_~i~0 0) (<= 32768 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49814#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32767) ~n)), 49815#(and (<= (+ foo_~i~0 32766) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32765) ~n)), 49817#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32764) ~n)), 49818#(and (= ~a.offset 0) (<= (+ foo_~i~0 32763) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49819#(and (<= (+ foo_~i~0 32762) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32761) ~n)), 49821#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32760) ~n)), 49822#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32759) ~n)), 49823#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32758) ~n)), 49824#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32757) ~n)), 49825#(and (<= (+ foo_~i~0 32756) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49826#(and (= ~a.offset 0) (<= (+ foo_~i~0 32755) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49827#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32754) ~n)), 49828#(and (= ~a.offset 0) (<= (+ foo_~i~0 32753) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49829#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32752) ~n)), 49830#(and (= ~a.offset 0) (<= (+ foo_~i~0 32751) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49831#(and (<= (+ foo_~i~0 32750) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49832#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32749) ~n)), 49833#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32748) ~n)), 49834#(and (<= (+ foo_~i~0 32747) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49835#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32746) ~n)), 49836#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32745) ~n)), 49837#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32744) ~n)), 49838#(and (= ~a.offset 0) (<= (+ foo_~i~0 32743) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49839#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32742) ~n)), 49840#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32741) ~n)), 49841#(and (= ~a.offset 0) (<= (+ foo_~i~0 32740) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49842#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32739) ~n)), 49843#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32738) ~n)), 49844#(and (= ~a.offset 0) (<= (+ foo_~i~0 32737) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32736) ~n)), 49846#(and (<= (+ foo_~i~0 32735) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49847#(and (= ~a.offset 0) (<= (+ foo_~i~0 32734) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49848#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32733) ~n)), 49849#(and (<= (+ foo_~i~0 32732) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49850#(and (<= (+ foo_~i~0 32731) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49851#(and (<= (+ foo_~i~0 32730) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49852#(and (= ~a.offset 0) (<= (+ foo_~i~0 32729) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49853#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32728) ~n)), 49854#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32727) ~n)), 49855#(and (<= (+ foo_~i~0 32726) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49856#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32725) ~n)), 49857#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32724) ~n)), 49858#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32723) ~n)), 49859#(and (<= (+ foo_~i~0 32722) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49860#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32721) ~n)), 49861#(and (= ~a.offset 0) (<= (+ foo_~i~0 32720) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49862#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32719) ~n)), 49863#(and (<= (+ foo_~i~0 32718) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49864#(and (<= (+ foo_~i~0 32717) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49865#(and (<= (+ foo_~i~0 32716) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32715) ~n)), 49867#(and (<= (+ foo_~i~0 32714) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49868#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32713) ~n)), 49869#(and (= ~a.offset 0) (<= (+ foo_~i~0 32712) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49870#(and (<= (+ foo_~i~0 32711) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49871#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32710) ~n)), 49872#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32709) ~n)), 49873#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32708) ~n)), 49874#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32707) ~n)), 49875#(and (<= (+ foo_~i~0 32706) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49876#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32705) ~n)), 49877#(and (<= (+ foo_~i~0 32704) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49878#(and (<= (+ foo_~i~0 32703) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49879#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32702) ~n)), 49880#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32702) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 49881#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 32701) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 49882#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 130804) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:07:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:35,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 02:07:35,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 02:07:35,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2365, Invalid=3185, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 02:07:35,234 INFO L87 Difference]: Start difference. First operand 312 states and 314 transitions. Second operand 75 states. Received shutdown request... [2018-02-04 02:07:37,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 02:07:37,006 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 02:07:37,009 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 02:07:37,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:07:37 BoogieIcfgContainer [2018-02-04 02:07:37,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:07:37,010 INFO L168 Benchmark]: Toolchain (without parser) took 186180.62 ms. Allocated memory was 406.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 363.5 MB in the beginning and 545.8 MB in the end (delta: -182.2 MB). Peak memory consumption was 979.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:37,010 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:07:37,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.97 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 352.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:37,011 INFO L168 Benchmark]: Boogie Preprocessor took 29.01 ms. Allocated memory is still 406.8 MB. Free memory was 352.9 MB in the beginning and 351.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:37,011 INFO L168 Benchmark]: RCFGBuilder took 203.64 ms. Allocated memory is still 406.8 MB. Free memory was 351.6 MB in the beginning and 331.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:37,011 INFO L168 Benchmark]: TraceAbstraction took 185801.67 ms. Allocated memory was 406.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 331.7 MB in the beginning and 545.8 MB in the end (delta: -214.1 MB). Peak memory consumption was 947.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:37,012 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.13 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.97 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 352.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.01 ms. Allocated memory is still 406.8 MB. Free memory was 352.9 MB in the beginning and 351.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 203.64 ms. Allocated memory is still 406.8 MB. Free memory was 351.6 MB in the beginning and 331.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 185801.67 ms. Allocated memory was 406.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 331.7 MB in the beginning and 545.8 MB in the end (delta: -214.1 MB). Peak memory consumption was 947.8 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 constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (312states) and interpolant automaton (currently 53 states, 75 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 185.7s OverallTime, 71 OverallIterations, 68 TraceHistogramMax, 106.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2074 SDtfs, 113795 SDslu, 43344 SDs, 0 SdLazy, 49734 SolverSat, 27720 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5163 GetRequests, 72 SyntacticMatches, 69 SemanticMatches, 5021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65439 ImplicationChecksByTransitivity, 126.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/207298 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 18023 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 71.4s InterpolantComputationTime, 10307 NumberOfCodeBlocks, 10307 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 10236 ConstructedInterpolants, 0 QuantifiedInterpolants, 30442720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 4 PerfectInterpolantSequences, 0/207298 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_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-07-37-019.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-07-37-019.csv Completed graceful shutdown