java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:30:28,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:30:28,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:30:28,319 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:30:28,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:30:28,320 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:30:28,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:30:28,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:30:28,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:30:28,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:30:28,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:30:28,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:30:28,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:30:28,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:30:28,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:30:28,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:30:28,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:30:28,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:30:28,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:30:28,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:30:28,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:30:28,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:30:28,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:30:28,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:30:28,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:30:28,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:30:28,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:30:28,340 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:30:28,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:30:28,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:30:28,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:30:28,341 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:30:28,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:30:28,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:30:28,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:30:28,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:30:28,352 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:30:28,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:30:28,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:30:28,353 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:30:28,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:30:28,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:30:28,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:30:28,353 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:30:28,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:30:28,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:30:28,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:30:28,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:30:28,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:30:28,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:30:28,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:30:28,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:30:28,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:30:28,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:30:28,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:30:28,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:30:28,396 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:30:28,399 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:30:28,401 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:30:28,401 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:30:28,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:30:28,546 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:30:28,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:30:28,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:30:28,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:30:28,552 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:30:28,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e89376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28, skipping insertion in model container [2018-02-02 10:30:28,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,565 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:30:28,594 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:30:28,696 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:30:28,714 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:30:28,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28 WrapperNode [2018-02-02 10:30:28,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:30:28,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:30:28,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:30:28,723 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:30:28,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... [2018-02-02 10:30:28,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:30:28,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:30:28,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:30:28,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:30:28,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:30:28,797 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:30:28,797 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:30:28,797 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:30:28,797 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:30:28,797 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:30:28,798 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:30:28,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:30:28,799 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:30:28,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:30:28,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:30:29,179 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:30:29,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:30:29 BoogieIcfgContainer [2018-02-02 10:30:29,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:30:29,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:30:29,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:30:29,183 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:30:29,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:30:28" (1/3) ... [2018-02-02 10:30:29,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e83b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:30:29, skipping insertion in model container [2018-02-02 10:30:29,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:28" (2/3) ... [2018-02-02 10:30:29,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e83b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:30:29, skipping insertion in model container [2018-02-02 10:30:29,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:30:29" (3/3) ... [2018-02-02 10:30:29,185 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:30:29,190 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:30:29,195 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-02 10:30:29,218 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:30:29,219 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:30:29,219 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:30:29,219 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:30:29,219 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:30:29,219 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:30:29,219 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:30:29,220 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:30:29,220 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:30:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2018-02-02 10:30:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:30:29,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:29,239 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:29,239 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash -102951268, now seen corresponding path program 1 times [2018-02-02 10:30:29,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:29,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:29,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:29,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,348 INFO L182 omatonBuilderFactory]: Interpolants [160#false, 161#(= 1 (select |#valid| |main_#t~malloc0.base|)), 162#(= 1 (select |#valid| main_~bucket~0.base)), 159#true] [2018-02-02 10:30:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:29,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:29,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:29,415 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2018-02-02 10:30:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:29,585 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-02-02 10:30:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:29,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:30:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:29,594 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:30:29,594 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:30:29,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:30:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2018-02-02 10:30:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:30:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-02-02 10:30:29,627 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 8 [2018-02-02 10:30:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:29,628 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-02-02 10:30:29,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-02-02 10:30:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:30:29,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:29,628 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:29,629 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -102951267, now seen corresponding path program 1 times [2018-02-02 10:30:29,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:29,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:29,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:29,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,683 INFO L182 omatonBuilderFactory]: Interpolants [508#true, 509#false, 510#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 511#(and (= (select |#length| main_~bucket~0.base) 12) (= main_~bucket~0.offset 0))] [2018-02-02 10:30:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:29,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:29,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:29,685 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 4 states. [2018-02-02 10:30:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:29,830 INFO L93 Difference]: Finished difference Result 226 states and 236 transitions. [2018-02-02 10:30:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:29,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:30:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:29,832 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:30:29,833 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:30:29,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:30:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 145. [2018-02-02 10:30:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:30:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-02-02 10:30:29,841 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 8 [2018-02-02 10:30:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:29,842 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-02-02 10:30:29,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-02-02 10:30:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:30:29,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:29,842 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:29,843 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash 966243267, now seen corresponding path program 1 times [2018-02-02 10:30:29,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:29,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:29,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:29,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,896 INFO L182 omatonBuilderFactory]: Interpolants [885#true, 886#false, 887#(= 1 (select |#valid| |main_#t~malloc3.base|)), 888#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 889#(= 1 (select |#valid| |main_#t~mem5.base|)), 890#(= 1 (select |#valid| main_~bcki~0.base))] [2018-02-02 10:30:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:29,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:29,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:29,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:29,897 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 6 states. [2018-02-02 10:30:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:30,184 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-02-02 10:30:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:30:30,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 10:30:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:30,185 INFO L225 Difference]: With dead ends: 190 [2018-02-02 10:30:30,185 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:30:30,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:30:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2018-02-02 10:30:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:30:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-02-02 10:30:30,191 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 14 [2018-02-02 10:30:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:30,192 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2018-02-02 10:30:30,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-02-02 10:30:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:30:30,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:30,192 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:30,193 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash 966243268, now seen corresponding path program 1 times [2018-02-02 10:30:30,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:30,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:30,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:30,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,276 INFO L182 omatonBuilderFactory]: Interpolants [1235#true, 1236#false, 1237#(and (= 0 |main_#t~malloc3.offset|) (= 12 (select |#length| |main_#t~malloc3.base|))), 1238#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))), 1239#(and (= 12 (select |#length| |main_#t~mem5.base|)) (= 0 |main_#t~mem5.offset|)), 1240#(and (= (select |#length| main_~bcki~0.base) 12) (= main_~bcki~0.offset 0))] [2018-02-02 10:30:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:30,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:30,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:30,277 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 6 states. [2018-02-02 10:30:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:30,467 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2018-02-02 10:30:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:30:30,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 10:30:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:30,475 INFO L225 Difference]: With dead ends: 200 [2018-02-02 10:30:30,476 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 10:30:30,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 10:30:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 142. [2018-02-02 10:30:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:30:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-02-02 10:30:30,481 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 14 [2018-02-02 10:30:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:30,482 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-02-02 10:30:30,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-02-02 10:30:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:30:30,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:30,483 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:30,483 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1611969301, now seen corresponding path program 1 times [2018-02-02 10:30:30,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:30,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:30,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:30,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,566 INFO L182 omatonBuilderFactory]: Interpolants [1591#true, 1592#false, 1593#(and (= 12 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 1594#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))), 1595#(and (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 1596#(and (= (select |#length| main_~bcki~0.base) 12) (= main_~bcki~0.offset 0))] [2018-02-02 10:30:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:30,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:30,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:30,566 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 6 states. [2018-02-02 10:30:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:30,714 INFO L93 Difference]: Finished difference Result 197 states and 220 transitions. [2018-02-02 10:30:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:30:30,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 10:30:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:30,715 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:30:30,715 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:30:30,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:30:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2018-02-02 10:30:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:30:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2018-02-02 10:30:30,721 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 20 [2018-02-02 10:30:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:30,721 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-02-02 10:30:30,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2018-02-02 10:30:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:30:30,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:30,722 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:30,722 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1611969302, now seen corresponding path program 1 times [2018-02-02 10:30:30,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:30,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:30,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:30,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,765 INFO L182 omatonBuilderFactory]: Interpolants [1939#true, 1940#false, 1941#(= 1 (select |#valid| |main_#t~malloc8.base|)), 1942#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))), 1943#(= 1 (select |#valid| |main_#t~mem10.base|)), 1944#(= 1 (select |#valid| main_~bcki~0.base))] [2018-02-02 10:30:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:30,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:30,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:30,766 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 6 states. [2018-02-02 10:30:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:30,884 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-02-02 10:30:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:30:30,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 10:30:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:30,885 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:30:30,885 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:30:30,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:30:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 138. [2018-02-02 10:30:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 10:30:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-02-02 10:30:30,889 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 20 [2018-02-02 10:30:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:30,890 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-02-02 10:30:30,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-02-02 10:30:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:30:30,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:30,891 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:30,891 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1348719488, now seen corresponding path program 1 times [2018-02-02 10:30:30,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:30,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:30,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:30,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,950 INFO L182 omatonBuilderFactory]: Interpolants [2272#false, 2273#(= 1 (select |#valid| |main_#t~malloc15.base|)), 2274#(= 1 (select |#valid| main_~item~0.base)), 2271#true] [2018-02-02 10:30:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:30,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:30,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:30,951 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 4 states. [2018-02-02 10:30:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:31,035 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-02-02 10:30:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:31,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:30:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:31,036 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:30:31,036 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:30:31,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:30:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 133. [2018-02-02 10:30:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:30:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-02-02 10:30:31,039 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 29 [2018-02-02 10:30:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:31,040 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-02-02 10:30:31,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-02-02 10:30:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:30:31,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:31,040 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:31,041 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1348719489, now seen corresponding path program 1 times [2018-02-02 10:30:31,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:31,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:31,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:31,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,093 INFO L182 omatonBuilderFactory]: Interpolants [2588#true, 2589#false, 2590#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 2591#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 10:30:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:31,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:31,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:31,094 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 4 states. [2018-02-02 10:30:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:31,176 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-02-02 10:30:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:31,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:30:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:31,178 INFO L225 Difference]: With dead ends: 196 [2018-02-02 10:30:31,178 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 10:30:31,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 10:30:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 128. [2018-02-02 10:30:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:30:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2018-02-02 10:30:31,180 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 29 [2018-02-02 10:30:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:31,180 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2018-02-02 10:30:31,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2018-02-02 10:30:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:30:31,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:31,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:31,181 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1136810599, now seen corresponding path program 1 times [2018-02-02 10:30:31,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:31,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:31,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:31,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,242 INFO L182 omatonBuilderFactory]: Interpolants [2919#true, 2920#false, 2921#(= 1 (select |#valid| main_~bucket~0.base)), 2922#(and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 1 (select |#valid| main_~bucket~0.base))), 2923#(= 1 (select |#valid| main_~bcki~0.base))] [2018-02-02 10:30:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:31,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:31,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:31,243 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 5 states. [2018-02-02 10:30:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:31,388 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2018-02-02 10:30:31,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:30:31,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 10:30:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:31,390 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:30:31,390 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:30:31,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:30:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:30:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2018-02-02 10:30:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:30:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2018-02-02 10:30:31,394 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 30 [2018-02-02 10:30:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:31,397 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2018-02-02 10:30:31,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2018-02-02 10:30:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:30:31,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:31,398 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:31,398 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1136810598, now seen corresponding path program 1 times [2018-02-02 10:30:31,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:31,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:31,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:30:31,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,536 INFO L182 omatonBuilderFactory]: Interpolants [3234#true, 3235#false, 3236#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 3237#(and (= 12 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 3238#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 12 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 3239#(and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (<= 12 (select |#length| main_~bucket~0.base))), 3240#(and (= 0 main_~bucket~0.offset) (<= 12 (select |#length| main_~bucket~0.base))), 3241#(and (<= 12 (select |#length| main_~bcki~0.base)) (= main_~bcki~0.offset 0))] [2018-02-02 10:30:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:31,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:30:31,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:30:31,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:30:31,537 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 8 states. [2018-02-02 10:30:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:31,968 INFO L93 Difference]: Finished difference Result 337 states and 370 transitions. [2018-02-02 10:30:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:30:31,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 10:30:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:31,969 INFO L225 Difference]: With dead ends: 337 [2018-02-02 10:30:31,969 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 10:30:31,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 10:30:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 178. [2018-02-02 10:30:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:30:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2018-02-02 10:30:31,973 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 30 [2018-02-02 10:30:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:31,973 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-02-02 10:30:31,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:30:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2018-02-02 10:30:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:30:31,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:31,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:31,974 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash -881389387, now seen corresponding path program 1 times [2018-02-02 10:30:31,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:31,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:32,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:30:32,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,030 INFO L182 omatonBuilderFactory]: Interpolants [3779#true, 3780#false, 3781#(not (= 0 |main_#t~malloc0.base|)), 3782#(not (= 0 main_~bucket~0.base)), 3783#(not (= 0 main_~bcki~0.base))] [2018-02-02 10:30:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:32,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:32,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:32,030 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand 5 states. [2018-02-02 10:30:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:32,116 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2018-02-02 10:30:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:32,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 10:30:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:32,116 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:30:32,117 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:30:32,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:30:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:30:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 178. [2018-02-02 10:30:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:30:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2018-02-02 10:30:32,120 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 31 [2018-02-02 10:30:32,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:32,120 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2018-02-02 10:30:32,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2018-02-02 10:30:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:30:32,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:32,121 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:32,122 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash 12023425, now seen corresponding path program 1 times [2018-02-02 10:30:32,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:32,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:32,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:30:32,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,474 INFO L182 omatonBuilderFactory]: Interpolants [4192#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4193#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4194#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 4195#(and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|)), 4196#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 4181#true, 4182#false, 4183#(= 1 (select |#valid| main_~bucket~0.base)), 4184#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4185#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset |main_#t~malloc3.offset|) (+ main_~bucket~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset |main_#t~malloc3.base|) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~malloc3.base|))), 4186#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4187#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4188#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4189#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~malloc8.base|))), 4190#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 4191#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))))] [2018-02-02 10:30:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:30:32,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:30:32,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:30:32,475 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand 16 states. [2018-02-02 10:30:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:33,187 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2018-02-02 10:30:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:30:33,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-02-02 10:30:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:33,189 INFO L225 Difference]: With dead ends: 211 [2018-02-02 10:30:33,189 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 10:30:33,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:30:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 10:30:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 189. [2018-02-02 10:30:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:30:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2018-02-02 10:30:33,194 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 35 [2018-02-02 10:30:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:33,195 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2018-02-02 10:30:33,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:30:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2018-02-02 10:30:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:30:33,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:33,196 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:33,196 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:33,196 INFO L82 PathProgramCache]: Analyzing trace with hash -646683238, now seen corresponding path program 1 times [2018-02-02 10:30:33,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:33,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:33,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:33,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:33,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:33,632 INFO L182 omatonBuilderFactory]: Interpolants [4640#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (not (= 0 main_~bucket~0.base)) (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem5.base|) (= 0 main_~bucket~0.offset)), 4641#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4642#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4643#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (not (= 0 main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset)), 4644#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4645#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4646#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4647#(and (not (= 0 main_~bcki~0.base)) (not (= main_~bcki~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)))), 4648#(and (= 1 (select (store |#valid| main_~bucket~0.base 0) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= 0 main_~bucket~0.base))), 4649#(and (not (= 0 main_~bucket~0.base)) (= 1 (select (store |#valid| main_~bucket~0.base 0) |main_#t~mem36.base|))), 4650#(and (not (= 0 main_~bucket~0.base)) (= 1 (select (store |#valid| main_~bucket~0.base 0) main_~bcki~0.base))), 4651#(= 1 (select |#valid| main_~bcki~0.base)), 4633#true, 4634#false, 4635#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4636#(and (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4637#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 4638#(and (not (= 0 main_~bucket~0.base)) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 4639#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset))] [2018-02-02 10:30:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:33,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:30:33,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:30:33,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:33,634 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand 19 states. [2018-02-02 10:30:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:34,532 INFO L93 Difference]: Finished difference Result 236 states and 254 transitions. [2018-02-02 10:30:34,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:30:34,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-02-02 10:30:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:34,533 INFO L225 Difference]: With dead ends: 236 [2018-02-02 10:30:34,533 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:30:34,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=411, Invalid=1395, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:30:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:30:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 200. [2018-02-02 10:30:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 10:30:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2018-02-02 10:30:34,538 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 45 [2018-02-02 10:30:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:34,538 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2018-02-02 10:30:34,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:30:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2018-02-02 10:30:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:30:34,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:34,539 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:34,539 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -646683237, now seen corresponding path program 1 times [2018-02-02 10:30:34,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:34,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:34,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:34,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:30:34,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:34,886 INFO L182 omatonBuilderFactory]: Interpolants [5152#(and (= (select |#length| main_~bcki~0.base) 12) (= main_~bcki~0.offset 0)), 5136#true, 5137#false, 5138#(= 0 |main_#t~malloc0.offset|), 5139#(= 0 main_~bucket~0.offset), 5140#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 5141#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))), 5142#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 5143#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 12 (select |#length| |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 5144#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 5145#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 main_~bucket~0.offset)), 5146#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset)), 5147#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 5148#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 5149#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 5150#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)))), 5151#(and (= 0 |main_#t~mem36.offset|) (= 12 (select |#length| |main_#t~mem36.base|)))] [2018-02-02 10:30:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:34,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:30:34,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:30:34,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:30:34,887 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand 17 states. [2018-02-02 10:30:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:35,483 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2018-02-02 10:30:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:30:35,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-02-02 10:30:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:35,485 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:30:35,485 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:30:35,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:30:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:30:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2018-02-02 10:30:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:30:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-02-02 10:30:35,489 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 45 [2018-02-02 10:30:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:35,489 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-02-02 10:30:35,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:30:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-02-02 10:30:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:30:35,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:35,490 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:35,490 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:35,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1427656916, now seen corresponding path program 1 times [2018-02-02 10:30:35,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:35,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:35,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:35,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:30:35,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:35,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-02 10:30:35,744 INFO L182 omatonBuilderFactory]: Interpolants [5639#true, 5640#false, 5641#(= 0 |main_#t~malloc0.offset|), 5642#(= 0 main_~bucket~0.offset), 5643#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 5644#(and (not (= 0 |main_#t~malloc3.base|)) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 5645#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 5646#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 5647#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)))), 5648#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)))), 5649#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 5650#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 5651#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 5652#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 5653#(not (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))), 5654#(not (= 0 |main_#t~mem36.base|)), 5655#(not (= 0 main_~bcki~0.base))] [2018-02-02 10:30:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:35,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:30:35,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:30:35,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:30:35,745 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 17 states. [2018-02-02 10:30:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:36,213 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2018-02-02 10:30:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:30:36,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-02-02 10:30:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:36,214 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:30:36,214 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:30:36,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:30:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:30:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2018-02-02 10:30:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:30:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2018-02-02 10:30:36,218 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 46 [2018-02-02 10:30:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:36,218 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2018-02-02 10:30:36,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:30:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2018-02-02 10:30:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:30:36,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:36,218 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:36,218 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1219639155, now seen corresponding path program 1 times [2018-02-02 10:30:36,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:36,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:36,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:36,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:30:36,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:36,484 INFO L182 omatonBuilderFactory]: Interpolants [6144#false, 6145#(= 0 |main_#t~malloc0.offset|), 6146#(= 0 main_~bucket~0.offset), 6147#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 6148#(and (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 6149#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 6150#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 6151#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset)), 6152#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 6153#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset)), 6154#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 6155#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 6156#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 6157#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= |main_#t~malloc15.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 6158#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (= main_~bucket~0.base main_~item~0.base) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))), 6159#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= main_~bucket~0.base main_~item~0.base)) (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 6160#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 6161#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))), 6162#(= 1 (select |#valid| |main_#t~mem24.base|)), 6163#(= 1 (select |#valid| main_~bcki~0.base)), 6143#true] [2018-02-02 10:30:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:36,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:30:36,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:30:36,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:30:36,485 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand 21 states. [2018-02-02 10:30:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:37,674 INFO L93 Difference]: Finished difference Result 343 states and 382 transitions. [2018-02-02 10:30:37,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:30:37,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-02-02 10:30:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:37,675 INFO L225 Difference]: With dead ends: 343 [2018-02-02 10:30:37,675 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 10:30:37,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=537, Invalid=1913, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:30:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 10:30:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 221. [2018-02-02 10:30:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:30:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 258 transitions. [2018-02-02 10:30:37,680 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 258 transitions. Word has length 47 [2018-02-02 10:30:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:37,680 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 258 transitions. [2018-02-02 10:30:37,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:30:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 258 transitions. [2018-02-02 10:30:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:30:37,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:37,681 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:37,681 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1219639156, now seen corresponding path program 1 times [2018-02-02 10:30:37,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:37,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:38,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:38,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:30:38,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:38,149 INFO L182 omatonBuilderFactory]: Interpolants [6786#true, 6787#false, 6788#(= 0 |main_#t~malloc0.offset|), 6789#(= 0 main_~bucket~0.offset), 6790#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 6791#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))), 6792#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 6793#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 12 (select |#length| |main_#t~mem5.base|)) (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem5.base|) (= 0 main_~bucket~0.offset)), 6794#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 6795#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= (select |#length| main_~bcki~0.base) 12) (= 0 main_~bucket~0.offset)), 6796#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= (select |#length| main_~bcki~0.base) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 6797#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 6798#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 6799#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 6800#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (or (not (= main_~bucket~0.base |main_#t~malloc15.base|)) (and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)))), 6801#(and (or (and (= 8 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (= main_~bucket~0.base main_~item~0.base) (and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))), 6802#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 6803#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)))), 6804#(and (<= 12 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 6805#(and (<= 12 (select |#length| main_~bcki~0.base)) (= main_~bcki~0.offset 0))] [2018-02-02 10:30:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:38,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:30:38,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:30:38,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:30:38,150 INFO L87 Difference]: Start difference. First operand 221 states and 258 transitions. Second operand 20 states. [2018-02-02 10:30:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:39,564 INFO L93 Difference]: Finished difference Result 388 states and 438 transitions. [2018-02-02 10:30:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:30:39,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-02-02 10:30:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:39,565 INFO L225 Difference]: With dead ends: 388 [2018-02-02 10:30:39,565 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 10:30:39,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:30:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 10:30:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 219. [2018-02-02 10:30:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:30:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2018-02-02 10:30:39,570 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 47 [2018-02-02 10:30:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:39,571 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2018-02-02 10:30:39,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:30:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2018-02-02 10:30:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:30:39,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:39,572 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:39,572 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1500352288, now seen corresponding path program 1 times [2018-02-02 10:30:39,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:39,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:40,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:40,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:30:40,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:40,416 INFO L182 omatonBuilderFactory]: Interpolants [7488#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 7465#true, 7466#false, 7467#(= 0 |main_#t~malloc0.offset|), 7468#(= 0 main_~bucket~0.offset), 7469#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 7470#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 7471#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 7472#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 7473#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (or (< main_~bcki~0.offset main_~bucket~0.offset) (and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0)), 7474#(and (= (select |#valid| main_~bucket~0.base) 1) (or (and (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))) (< main_~bcki~0.offset main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bucket~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))), 7475#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= (select |#valid| main_~bcki~0.base) 1) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (< main_~bcki~0.offset main_~bucket~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 7476#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|) (+ main_~bcki~0.offset 4)))) (< main_~bcki~0.offset main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset)), 7477#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (<= 0 main_~bcki~0.offset) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 7478#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~mem10.base|)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 7479#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 7480#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 7481#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 7482#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (+ 0 4)))), 7483#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4)))), 7484#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) (+ 0 4))) (= 0 |main_#t~mem36.offset|)), 7485#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 7486#(and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|) (= main_~bcki~0.offset 0)), 7487#(and (= 0 main_~item~0.base) (= main_~bcki~0.offset 0) (= main_~item~0.offset 0))] [2018-02-02 10:30:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:40,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:30:40,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:30:40,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:30:40,416 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand 24 states. [2018-02-02 10:30:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:41,546 INFO L93 Difference]: Finished difference Result 249 states and 274 transitions. [2018-02-02 10:30:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:30:41,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-02-02 10:30:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:41,546 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:30:41,547 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:30:41,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=440, Invalid=2212, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:30:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:30:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 226. [2018-02-02 10:30:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 10:30:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 262 transitions. [2018-02-02 10:30:41,550 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 262 transitions. Word has length 50 [2018-02-02 10:30:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:41,550 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 262 transitions. [2018-02-02 10:30:41,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:30:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 262 transitions. [2018-02-02 10:30:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:30:41,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:41,551 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:41,551 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1693768018, now seen corresponding path program 1 times [2018-02-02 10:30:41,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:41,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:41,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:41,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:30:41,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:41,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-02 10:30:41,967 INFO L182 omatonBuilderFactory]: Interpolants [8032#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8033#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8034#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8035#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8036#(and (or (= main_~bucket~0.base main_~item~0.base) (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))))) (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 8037#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 8038#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 8039#(and (= |main_#t~mem25.base| 0) (= 0 |main_#t~mem25.offset|)), 8020#true, 8021#false, 8022#(= 0 |main_#t~malloc0.offset|), 8023#(= 0 main_~bucket~0.offset), 8024#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 8025#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8026#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset |main_#t~malloc3.offset|) (+ main_~bucket~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset |main_#t~malloc3.base|) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 8027#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8028#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8029#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 8030#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset)), 8031#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))))] [2018-02-02 10:30:41,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-02 10:30:41,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:30:41,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:30:41,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:30:41,968 INFO L87 Difference]: Start difference. First operand 226 states and 262 transitions. Second operand 20 states. [2018-02-02 10:30:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:42,873 INFO L93 Difference]: Finished difference Result 289 states and 326 transitions. [2018-02-02 10:30:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:30:42,873 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 10:30:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:42,874 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:30:42,874 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:30:42,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:30:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:30:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 231. [2018-02-02 10:30:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:30:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2018-02-02 10:30:42,878 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 52 [2018-02-02 10:30:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:42,879 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2018-02-02 10:30:42,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:30:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2018-02-02 10:30:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:30:42,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:42,879 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:42,880 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1416804127, now seen corresponding path program 2 times [2018-02-02 10:30:42,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:42,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:43,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:43,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:30:43,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:43,465 INFO L182 omatonBuilderFactory]: Interpolants [8606#true, 8607#false, 8608#(= 0 |main_#t~malloc0.offset|), 8609#(= 0 main_~bucket~0.offset), 8610#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 8611#(and (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 8612#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 8613#(and (= (select |#valid| main_~bucket~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 8614#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 8615#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 8616#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset)), 8617#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 8618#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) |main_#t~mem10.base|) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 8619#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 8620#(and (not (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 8621#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 main_~bucket~0.offset) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))), 8622#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 8623#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= |main_#t~malloc15.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~malloc15.base|))), 8624#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (= main_~bucket~0.base main_~item~0.base) (and (or (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))))), 8625#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.base main_~item~0.base))), 8626#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.base main_~item~0.base))), 8627#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 8628#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))), 8629#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|))), 8630#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))), 8631#(= 1 (select |#valid| |main_#t~mem24.base|)), 8632#(= 1 (select |#valid| main_~bcki~0.base))] [2018-02-02 10:30:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:43,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:30:43,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:30:43,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:30:43,466 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand 27 states. [2018-02-02 10:30:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:44,850 INFO L93 Difference]: Finished difference Result 326 states and 352 transitions. [2018-02-02 10:30:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:30:44,850 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-02-02 10:30:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:44,851 INFO L225 Difference]: With dead ends: 326 [2018-02-02 10:30:44,851 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 10:30:44,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=573, Invalid=2619, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:30:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 10:30:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 239. [2018-02-02 10:30:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:30:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 277 transitions. [2018-02-02 10:30:44,855 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 277 transitions. Word has length 53 [2018-02-02 10:30:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:44,855 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 277 transitions. [2018-02-02 10:30:44,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:30:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 277 transitions. [2018-02-02 10:30:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:30:44,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:44,856 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:44,856 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:44,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1416804128, now seen corresponding path program 2 times [2018-02-02 10:30:44,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:44,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:45,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:45,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:30:45,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:45,431 INFO L182 omatonBuilderFactory]: Interpolants [9280#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset|))), 9281#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))), 9282#(and (= 12 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 9283#(and (= (select |#length| main_~bcki~0.base) 12) (= main_~bcki~0.offset 0)), 9258#true, 9259#false, 9260#(= 0 |main_#t~malloc0.offset|), 9261#(= 0 main_~bucket~0.offset), 9262#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 9263#(and (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 9264#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 9265#(and (= (select |#valid| main_~bucket~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 9266#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 9267#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 9268#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 12 (select |#length| |main_#t~malloc8.base|)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= 0 |main_#t~malloc8.offset|)), 9269#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 9270#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) |main_#t~mem10.base|) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 9271#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 9272#(and (not (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 9273#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 12 (select |#length| main_~bcki~0.base)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))), 9274#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 9275#(and (or (not (= main_~bucket~0.base |main_#t~malloc15.base|)) (and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~malloc15.base|))), 9276#(and (or (= main_~bucket~0.base main_~item~0.base) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))))) (or (and (= 8 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 9277#(and (or (and (= 8 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))))) (= main_~bucket~0.base main_~item~0.base))), 9278#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 9279#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))))] [2018-02-02 10:30:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:45,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:45,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:45,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:45,432 INFO L87 Difference]: Start difference. First operand 239 states and 277 transitions. Second operand 26 states. [2018-02-02 10:30:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:47,184 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2018-02-02 10:30:47,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:30:47,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 53 [2018-02-02 10:30:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:47,185 INFO L225 Difference]: With dead ends: 346 [2018-02-02 10:30:47,185 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 10:30:47,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:30:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 10:30:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 237. [2018-02-02 10:30:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:30:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 274 transitions. [2018-02-02 10:30:47,187 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 274 transitions. Word has length 53 [2018-02-02 10:30:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:47,188 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 274 transitions. [2018-02-02 10:30:47,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 274 transitions. [2018-02-02 10:30:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:30:47,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:47,188 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:47,188 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1909635802, now seen corresponding path program 1 times [2018-02-02 10:30:47,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:47,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:47,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:47,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:30:47,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:47,522 INFO L182 omatonBuilderFactory]: Interpolants [9920#(= 0 main_~bucket~0.offset), 9921#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9922#(and (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9923#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9924#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9925#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9926#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9927#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9928#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9929#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= (select (select (store |#memory_int| main_~bcki~0.base (store (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8) 2)) main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0) (= 0 main_~bucket~0.offset)), 9930#(and (= 0 main_~bucket~0.offset) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9931#(and (or (not (= main_~bucket~0.base |main_#t~malloc15.base|)) (and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset))) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)), 9932#(and (or (= main_~bucket~0.base main_~item~0.base) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) 0)) (or (and (= 8 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 9933#(and (or (= main_~bucket~0.base main_~item~0.base) (= (select (select |#memory_int| main_~bucket~0.base) (+ main_~bucket~0.offset 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)))) (or (and (= 8 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 9934#(or (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 9935#(= |main_#t~mem22| (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))), 9936#(= |main_#t~mem23| |main_#t~mem22|), 9917#true, 9918#false, 9919#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:30:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:47,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:30:47,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:30:47,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:30:47,523 INFO L87 Difference]: Start difference. First operand 237 states and 274 transitions. Second operand 20 states. [2018-02-02 10:30:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:48,376 INFO L93 Difference]: Finished difference Result 298 states and 340 transitions. [2018-02-02 10:30:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:30:48,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-02-02 10:30:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:48,413 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:30:48,413 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:30:48,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:30:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:30:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 248. [2018-02-02 10:30:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:30:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 285 transitions. [2018-02-02 10:30:48,416 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 285 transitions. Word has length 58 [2018-02-02 10:30:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:48,416 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 285 transitions. [2018-02-02 10:30:48,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:30:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 285 transitions. [2018-02-02 10:30:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:30:48,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:48,416 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:48,416 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1751879852, now seen corresponding path program 1 times [2018-02-02 10:30:48,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:48,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:49,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:49,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:30:49,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:49,393 INFO L182 omatonBuilderFactory]: Interpolants [10519#true, 10520#false, 10521#(= 0 |main_#t~malloc0.offset|), 10522#(= 0 main_~bucket~0.offset), 10523#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 10524#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 10525#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 10526#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 10527#(and (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.offset 0) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 10528#(and (= main_~bucket~0.offset 0) (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 10529#(and (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= (select |#valid| main_~bcki~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4))))) (= main_~bucket~0.offset 0) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 10530#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|) (+ main_~bcki~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|) (+ main_~bcki~0.offset 4)))) (not (= main_~bucket~0.offset main_~bcki~0.offset))) (= main_~bucket~0.offset 0) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 10531#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset main_~bcki~0.offset) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= (select |#valid| main_~bcki~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 10532#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 10533#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 10534#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bucket~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 10535#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))), 10536#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~malloc15.base|))), 10537#(and (= main_~bucket~0.offset 0) (or (= 8 (select |#length| main_~bucket~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4)))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= main_~bucket~0.base main_~item~0.base))), 10538#(and (= main_~bucket~0.offset 0) (or (= main_~bucket~0.base main_~item~0.base) (and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (or (= 8 (select |#length| main_~bucket~0.base)) (not (= main_~bucket~0.base main_~item~0.base)))), 10539#(or (and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 10540#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))), 10541#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) (+ 0 4)))) (= 8 (select |#length| |main_#t~mem24.base|))) (= 0 |main_#t~mem24.offset|)), 10542#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (= (select |#length| main_~bcki~0.base) 8)) (= main_~bcki~0.offset 0)), 10543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 10544#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 10545#(and (= |main_#t~mem25.base| 0) (= 0 |main_#t~mem25.offset|))] [2018-02-02 10:30:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:49,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:30:49,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:30:49,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:30:49,394 INFO L87 Difference]: Start difference. First operand 248 states and 285 transitions. Second operand 27 states. [2018-02-02 10:30:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:51,505 INFO L93 Difference]: Finished difference Result 319 states and 350 transitions. [2018-02-02 10:30:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:30:51,505 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-02-02 10:30:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:51,506 INFO L225 Difference]: With dead ends: 319 [2018-02-02 10:30:51,506 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 10:30:51,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=530, Invalid=2662, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:30:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 10:30:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 248. [2018-02-02 10:30:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:30:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 285 transitions. [2018-02-02 10:30:51,509 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 285 transitions. Word has length 59 [2018-02-02 10:30:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:51,509 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 285 transitions. [2018-02-02 10:30:51,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:30:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 285 transitions. [2018-02-02 10:30:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:51,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:51,509 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:51,509 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash 829916025, now seen corresponding path program 2 times [2018-02-02 10:30:51,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:51,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:52,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:52,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:30:52,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:52,238 INFO L182 omatonBuilderFactory]: Interpolants [11173#true, 11174#false, 11175#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 11176#(and (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 11177#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 11178#(and (not (= 0 main_~bucket~0.base)) (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 11179#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 11180#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 11181#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11182#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11183#(and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= 0 main_~bucket~0.base)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11184#(and (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= 0 main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11185#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0) |main_#t~mem10.base|) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 11186#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) main_~bcki~0.base))), 11187#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset) main_~bcki~0.base)) (not (= 0 main_~bucket~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) 0)) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 11188#(and (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)))), 11189#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0))) (not (= (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0))) (not (= 0 main_~bcki~0.base)) (not (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0)))), 11190#(and (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0))) (not (= 0 main_~bcki~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)))), 11191#(and (not (= 0 main_~bucket~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0))) (= 1 (select (store |#valid| main_~bucket~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)))), 11192#(and (not (= |main_#t~mem36.base| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0))) (= 1 (select (store |#valid| main_~bucket~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0))) (not (= 0 main_~bucket~0.base))), 11193#(or (not (= 0 main_~bcki~0.offset)) (and (= 1 (select (store |#valid| main_~bucket~0.base 0) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (not (= 0 main_~bucket~0.base)) (not (= main_~bcki~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))))), 11194#(or (and (not (= main_~bcki~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)))) (not (= 0 main_~bcki~0.offset))), 11195#(or (and (not (= 0 main_~bcki~0.base)) (not (= main_~bcki~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)))) (not (= 0 main_~bcki~0.offset))), 11196#(or (<= (+ main_~bcki~0.offset 4) 0) (not (= 0 main_~bucket~0.offset)) (and (= 1 (select (store |#valid| main_~bucket~0.base 0) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= 0 main_~bucket~0.base)))), 11197#(or (not (= 0 main_~bucket~0.offset)) (and (not (= 0 main_~bucket~0.base)) (= 1 (select (store |#valid| main_~bucket~0.base 0) |main_#t~mem36.base|)))), 11198#(or (and (not (= 0 main_~bucket~0.base)) (= 1 (select (store |#valid| main_~bucket~0.base 0) main_~bcki~0.base))) (not (= 0 main_~bucket~0.offset))), 11199#(= 1 (select |#valid| main_~bcki~0.base))] [2018-02-02 10:30:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:52,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:30:52,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:30:52,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:30:52,239 INFO L87 Difference]: Start difference. First operand 248 states and 285 transitions. Second operand 27 states. [2018-02-02 10:30:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:53,790 INFO L93 Difference]: Finished difference Result 287 states and 307 transitions. [2018-02-02 10:30:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:30:53,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 10:30:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:53,791 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:30:53,791 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:30:53,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=480, Invalid=2826, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:30:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:30:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 259. [2018-02-02 10:30:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:30:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 298 transitions. [2018-02-02 10:30:53,794 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 298 transitions. Word has length 60 [2018-02-02 10:30:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:53,795 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 298 transitions. [2018-02-02 10:30:53,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:30:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 298 transitions. [2018-02-02 10:30:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:53,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:53,796 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:53,796 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:53,796 INFO L82 PathProgramCache]: Analyzing trace with hash 829916026, now seen corresponding path program 2 times [2018-02-02 10:30:53,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:53,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:54,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:54,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:30:54,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:54,361 INFO L182 omatonBuilderFactory]: Interpolants [11808#true, 11809#false, 11810#(= 0 |main_#t~malloc0.offset|), 11811#(= 0 main_~bucket~0.offset), 11812#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 11813#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 11814#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 11815#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 11816#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11817#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11818#(and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 12 (select |#length| |main_#t~malloc8.base|)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0) (= 0 |main_#t~malloc8.offset|)), 11819#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 11820#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)))), 11821#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)))), 11822#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 0))) (not (= main_~bucket~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 11823#(and (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (= 0 main_~bucket~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)))), 11824#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0)))), 11825#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)))), 11826#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) 0))), 11827#(and (or (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (not (= 0 main_~bcki~0.offset))) (or (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (not (= 0 main_~bcki~0.offset)))), 11828#(or (and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= 0 main_~bucket~0.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (not (= 0 main_~bucket~0.offset)))) (<= (+ main_~bcki~0.offset 4) 0)), 11829#(and (or (= 0 |main_#t~mem36.offset|) (not (= 0 main_~bucket~0.offset))) (or (not (= 0 main_~bucket~0.offset)) (= 12 (select |#length| |main_#t~mem36.base|)))), 11830#(and (or (not (= 0 main_~bucket~0.offset)) (= main_~bcki~0.offset 0)) (or (= (select |#length| main_~bcki~0.base) 12) (not (= 0 main_~bucket~0.offset)))), 11831#(and (= (select |#length| main_~bcki~0.base) 12) (= main_~bcki~0.offset 0))] [2018-02-02 10:30:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:54,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:30:54,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:30:54,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:30:54,361 INFO L87 Difference]: Start difference. First operand 259 states and 298 transitions. Second operand 24 states. [2018-02-02 10:30:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:55,592 INFO L93 Difference]: Finished difference Result 320 states and 352 transitions. [2018-02-02 10:30:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:30:55,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-02-02 10:30:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:55,593 INFO L225 Difference]: With dead ends: 320 [2018-02-02 10:30:55,593 INFO L226 Difference]: Without dead ends: 320 [2018-02-02 10:30:55,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1846, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:30:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-02 10:30:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 258. [2018-02-02 10:30:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 10:30:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 296 transitions. [2018-02-02 10:30:55,596 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 296 transitions. Word has length 60 [2018-02-02 10:30:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:55,596 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 296 transitions. [2018-02-02 10:30:55,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:30:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2018-02-02 10:30:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:55,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:55,597 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:55,597 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1975902557, now seen corresponding path program 1 times [2018-02-02 10:30:55,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:55,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:56,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:56,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:30:56,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:56,384 INFO L182 omatonBuilderFactory]: Interpolants [12480#(or (<= (+ main_~bcki~0.offset 1) 0) (= |main_#t~mem23| |main_#t~mem22|)), 12481#(<= (+ main_~bcki~0.offset 1) 0), 12456#true, 12457#false, 12458#(= 0 |main_#t~malloc0.offset|), 12459#(= 0 main_~bucket~0.offset), 12460#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 12461#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))), 12462#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 12463#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 12 (select |#length| |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 12464#(and (= (select |#valid| main_~bucket~0.base) 1) (= 12 (select |#length| main_~bcki~0.base)) (or (and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base))) (not (= main_~bucket~0.offset main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 12465#(and (= (select |#valid| main_~bucket~0.base) 1) (= 12 (select |#length| main_~bcki~0.base)) (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) 1))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 12466#(and (= (select |#length| main_~bcki~0.base) 12) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (or (and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) 1)) (not (= main_~bucket~0.offset main_~bcki~0.offset)))), 12467#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset main_~bcki~0.offset) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= (select |#length| main_~bcki~0.base) 12) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1) (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) 1)), 12468#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) 1) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 12) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 12469#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= (select (select (store |#memory_int| main_~bcki~0.base (store (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8) 2)) (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) 1) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 12) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 12470#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) 1) (= 0 main_~bucket~0.offset) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 12) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 12471#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) 1) (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 12) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~malloc15.base|))), 12472#(and (or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (<= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 12) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) 1)) (= main_~bucket~0.base main_~item~0.base)) (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (= main_~bucket~0.offset 0)), 12473#(and (or (and (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 12) (= (select (select (store |#memory_int| main_~item~0.base (store (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4) 1)) (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) 1)) (= main_~bucket~0.base main_~item~0.base)) (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (= main_~bucket~0.offset 0)), 12474#(and (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (+ main_~bucket~0.offset 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 12)) (= main_~bucket~0.base main_~item~0.base)) (= main_~bucket~0.offset 0)), 12475#(or (and (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 11)) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 12)) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 12476#(and (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 11)) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 12)), 12477#(and (or (= (select (select |#memory_int| |main_#t~mem24.base|) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| |main_#t~mem24.base|) 11)) (<= (select |#length| |main_#t~mem24.base|) 12)), 12478#(or (<= (+ main_~bcki~0.offset 1) 0) (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| main_~bcki~0.base) (+ main_~bcki~0.offset 11))), 12479#(or (= |main_#t~mem22| (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (+ main_~bcki~0.offset 1) 0))] [2018-02-02 10:30:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:56,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:56,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:56,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:56,385 INFO L87 Difference]: Start difference. First operand 258 states and 296 transitions. Second operand 26 states. [2018-02-02 10:30:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:58,215 INFO L93 Difference]: Finished difference Result 355 states and 400 transitions. [2018-02-02 10:30:58,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:30:58,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-02-02 10:30:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:58,216 INFO L225 Difference]: With dead ends: 355 [2018-02-02 10:30:58,216 INFO L226 Difference]: Without dead ends: 354 [2018-02-02 10:30:58,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=2341, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:30:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-02 10:30:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 271. [2018-02-02 10:30:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 10:30:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 310 transitions. [2018-02-02 10:30:58,219 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 310 transitions. Word has length 60 [2018-02-02 10:30:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:58,219 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 310 transitions. [2018-02-02 10:30:58,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 310 transitions. [2018-02-02 10:30:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:58,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:58,219 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:58,220 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:58,220 INFO L82 PathProgramCache]: Analyzing trace with hash -127238979, now seen corresponding path program 1 times [2018-02-02 10:30:58,220 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:58,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:59,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:59,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:30:59,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:59,155 INFO L182 omatonBuilderFactory]: Interpolants [13184#(and (or (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) 11) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) 12)), 13185#(and (or (<= (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|)) 11) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|)) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|)) 12)), 13186#(and (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 11)) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 12)), 13187#(and (or (= (select (select |#memory_int| |main_#t~mem24.base|) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| |main_#t~mem24.base|) 11)) (<= (select |#length| |main_#t~mem24.base|) 12)), 13188#(or (<= (+ main_~bcki~0.offset 1) 0) (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| main_~bcki~0.base) (+ main_~bcki~0.offset 11))), 13189#(or (= |main_#t~mem22| (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (+ main_~bcki~0.offset 1) 0)), 13190#(or (<= (+ main_~bcki~0.offset 1) 0) (= |main_#t~mem23| |main_#t~mem22|)), 13191#(<= (+ main_~bcki~0.offset 1) 0), 13162#true, 13163#false, 13164#(= 0 |main_#t~malloc0.offset|), 13165#(= 0 main_~bucket~0.offset), 13166#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 13167#(and (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 13168#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 13169#(and (= (select |#valid| main_~bucket~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 13170#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 13171#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 13172#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 12 (select |#length| |main_#t~malloc8.base|)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= 0 |main_#t~malloc8.offset|)), 13173#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 13174#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) |main_#t~mem10.base|) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 |main_#t~mem10.offset|)), 13175#(and (or (and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= (select |#length| main_~bcki~0.base) 12) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)) (not (= main_~bucket~0.offset main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 13176#(and (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) 2) (not (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (= (select |#length| main_~bcki~0.base) 12) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= (select |#valid| main_~bcki~0.base) 1)))), 13177#(and (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (or (and (= (select (select |#memory_int| main_~bcki~0.base) (+ main_~bcki~0.offset 8)) 2) (not (= main_~bucket~0.base main_~bcki~0.base)) (= (select |#length| main_~bcki~0.base) 12) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= (select |#valid| main_~bcki~0.base) 1) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (not (= main_~bucket~0.offset main_~bcki~0.offset)))), 13178#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) 1) (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) 12) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 8)) 2) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 13179#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) 12) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) |main_#t~malloc15.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 8)) 2) (= 0 main_~bucket~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~malloc15.base|))), 13180#(and (or (and (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 8)) 2) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (<= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) 12) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))) (= main_~bucket~0.base main_~item~0.base)) (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (= main_~bucket~0.offset 0)), 13181#(and (or (= main_~bucket~0.base main_~item~0.base) (and (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) 12) (= (select (select (store |#memory_int| main_~item~0.base (store (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4) 2)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 8)) 2) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))))) (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (= main_~bucket~0.offset 0)), 13182#(and (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (= main_~bucket~0.offset 0) (or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) 12)) (= main_~bucket~0.base main_~item~0.base))), 13183#(or (and (or (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) 11) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (+ 0 8)) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) 12)) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8)))] [2018-02-02 10:30:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:59,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:30:59,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:30:59,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:30:59,156 INFO L87 Difference]: Start difference. First operand 271 states and 310 transitions. Second operand 30 states. [2018-02-02 10:31:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:01,792 INFO L93 Difference]: Finished difference Result 353 states and 396 transitions. [2018-02-02 10:31:01,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:31:01,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-02-02 10:31:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:01,793 INFO L225 Difference]: With dead ends: 353 [2018-02-02 10:31:01,793 INFO L226 Difference]: Without dead ends: 352 [2018-02-02 10:31:01,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=546, Invalid=3114, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:31:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-02 10:31:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 275. [2018-02-02 10:31:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 10:31:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 314 transitions. [2018-02-02 10:31:01,797 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 314 transitions. Word has length 60 [2018-02-02 10:31:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:01,797 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 314 transitions. [2018-02-02 10:31:01,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:31:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 314 transitions. [2018-02-02 10:31:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:01,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:01,798 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:01,798 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash -42406187, now seen corresponding path program 2 times [2018-02-02 10:31:01,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:01,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:02,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:02,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:31:02,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:02,286 INFO L182 omatonBuilderFactory]: Interpolants [13888#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 13889#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 13890#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 13891#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 13892#(and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (not (= 0 |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 13893#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)))), 13894#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0))) (= 0 main_~bucket~0.offset)), 13895#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0))) (= 0 main_~bucket~0.offset)), 13896#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 0))) (not (= main_~bucket~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 13897#(and (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0))) (= 0 main_~bucket~0.offset)), 13898#(not (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0))), 13899#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0))), 13900#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0))), 13901#(or (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (not (= 0 main_~bcki~0.offset))), 13902#(or (<= (+ main_~bcki~0.offset 4) 0) (not (= 0 main_~bucket~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)))), 13903#(or (not (= 0 main_~bucket~0.offset)) (not (= 0 |main_#t~mem36.base|))), 13904#(or (not (= 0 main_~bcki~0.base)) (not (= 0 main_~bucket~0.offset))), 13905#(not (= 0 main_~bcki~0.base)), 13882#true, 13883#false, 13884#(= 0 |main_#t~malloc0.offset|), 13885#(= 0 main_~bucket~0.offset), 13886#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 13887#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset))] [2018-02-02 10:31:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:02,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:31:02,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:31:02,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:31:02,287 INFO L87 Difference]: Start difference. First operand 275 states and 314 transitions. Second operand 24 states. [2018-02-02 10:31:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:03,371 INFO L93 Difference]: Finished difference Result 331 states and 364 transitions. [2018-02-02 10:31:03,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:31:03,372 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-02 10:31:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:03,373 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:31:03,373 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:31:03,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1931, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:31:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:31:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 273. [2018-02-02 10:31:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:31:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 311 transitions. [2018-02-02 10:31:03,377 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 311 transitions. Word has length 61 [2018-02-02 10:31:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:03,377 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 311 transitions. [2018-02-02 10:31:03,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:31:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 311 transitions. [2018-02-02 10:31:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:03,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:03,378 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:03,378 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -212707139, now seen corresponding path program 1 times [2018-02-02 10:31:03,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:03,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:03,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:31:03,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,598 INFO L182 omatonBuilderFactory]: Interpolants [14560#(= 0 |main_#t~malloc0.offset|), 14561#(= 0 main_~bucket~0.offset), 14562#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset) (= 0 |main_#t~malloc15.offset|)), 14563#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= 0 main_~bucket~0.offset)), 14564#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= 0 main_~bucket~0.offset) (= main_~bcki~0.base main_~bucket~0.base) (= main_~bcki~0.offset 0)), 14565#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 main_~bucket~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))))), 14566#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (= main_~bcki~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 14567#(and (= 0 |main_#t~mem31.offset|) (= 8 (select |#length| |main_#t~mem31.base|)) (= main_~bcki~0.offset 0)), 14568#(and (= (select |#length| main_~item~0.base) 8) (= main_~bcki~0.offset 0) (= main_~item~0.offset 0)), 14569#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 14558#true, 14559#false] [2018-02-02 10:31:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:03,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:03,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:03,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:03,598 INFO L87 Difference]: Start difference. First operand 273 states and 311 transitions. Second operand 12 states. [2018-02-02 10:31:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:04,044 INFO L93 Difference]: Finished difference Result 422 states and 489 transitions. [2018-02-02 10:31:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:31:04,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-02-02 10:31:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:04,045 INFO L225 Difference]: With dead ends: 422 [2018-02-02 10:31:04,045 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 10:31:04,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 10:31:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 300. [2018-02-02 10:31:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:31:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 342 transitions. [2018-02-02 10:31:04,049 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 342 transitions. Word has length 61 [2018-02-02 10:31:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:04,049 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 342 transitions. [2018-02-02 10:31:04,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 342 transitions. [2018-02-02 10:31:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:31:04,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:04,050 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:04,050 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -212707140, now seen corresponding path program 1 times [2018-02-02 10:31:04,051 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:04,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:04,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:31:04,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,116 INFO L182 omatonBuilderFactory]: Interpolants [15312#(= 1 (select |#valid| |main_#t~mem31.base|)), 15306#true, 15307#false, 15308#(= 1 (select |#valid| main_~item~0.base)), 15309#(and (= main_~bucket~0.offset main_~bcki~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= main_~bcki~0.base main_~bucket~0.base)), 15310#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 15311#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))))] [2018-02-02 10:31:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:31:04,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:31:04,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:31:04,117 INFO L87 Difference]: Start difference. First operand 300 states and 342 transitions. Second operand 7 states. [2018-02-02 10:31:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:04,428 INFO L93 Difference]: Finished difference Result 343 states and 387 transitions. [2018-02-02 10:31:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:31:04,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-02-02 10:31:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:04,429 INFO L225 Difference]: With dead ends: 343 [2018-02-02 10:31:04,429 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 10:31:04,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:31:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 10:31:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2018-02-02 10:31:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:31:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 341 transitions. [2018-02-02 10:31:04,432 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 341 transitions. Word has length 61 [2018-02-02 10:31:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:04,432 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 341 transitions. [2018-02-02 10:31:04,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:31:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 341 transitions. [2018-02-02 10:31:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:31:04,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:04,432 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:04,432 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1681452376, now seen corresponding path program 1 times [2018-02-02 10:31:04,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:04,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:04,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:04,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:04,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,519 INFO L182 omatonBuilderFactory]: Interpolants [15968#(= main_~itr~0.base main_~item~0.base), 15969#(= 1 (select |#valid| main_~itr~0.base)), 15966#true, 15967#false] [2018-02-02 10:31:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:04,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:04,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:04,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:04,520 INFO L87 Difference]: Start difference. First operand 300 states and 341 transitions. Second operand 4 states. [2018-02-02 10:31:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:04,593 INFO L93 Difference]: Finished difference Result 373 states and 420 transitions. [2018-02-02 10:31:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:04,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-02-02 10:31:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:04,594 INFO L225 Difference]: With dead ends: 373 [2018-02-02 10:31:04,594 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 10:31:04,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 10:31:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 296. [2018-02-02 10:31:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 10:31:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 333 transitions. [2018-02-02 10:31:04,598 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 333 transitions. Word has length 64 [2018-02-02 10:31:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:04,598 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 333 transitions. [2018-02-02 10:31:04,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 333 transitions. [2018-02-02 10:31:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:31:04,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:04,599 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:04,599 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1681452375, now seen corresponding path program 1 times [2018-02-02 10:31:04,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:04,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:04,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:31:04,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,832 INFO L182 omatonBuilderFactory]: Interpolants [16641#true, 16642#false, 16643#(= 0 |main_#t~malloc0.offset|), 16644#(= 0 main_~bucket~0.offset), 16645#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset) (= 0 |main_#t~malloc15.offset|)), 16646#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= 0 main_~bucket~0.offset)), 16647#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= main_~bucket~0.offset main_~bcki~0.offset) (= 0 main_~bucket~0.offset) (= main_~bcki~0.base main_~bucket~0.base)), 16648#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 main_~bucket~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))))), 16649#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (= main_~bcki~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 16650#(and (= 0 |main_#t~mem31.offset|) (= 8 (select |#length| |main_#t~mem31.base|)) (= main_~bcki~0.offset 0)), 16651#(and (= 8 (select |#length| main_~item~0.base)) (= main_~bcki~0.offset 0) (= main_~item~0.offset 0)), 16652#(and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)), 16653#(and (= main_~item~0.offset main_~itr~0.offset) (= main_~item~0.offset 0) (= 8 (select |#length| main_~itr~0.base))), 16654#(and (<= 0 main_~itr~0.offset) (<= main_~itr~0.offset 0) (= 8 (select |#length| main_~itr~0.base)))] [2018-02-02 10:31:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:04,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:04,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:04,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:04,833 INFO L87 Difference]: Start difference. First operand 296 states and 333 transitions. Second operand 14 states. [2018-02-02 10:31:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:05,377 INFO L93 Difference]: Finished difference Result 453 states and 514 transitions. [2018-02-02 10:31:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:31:05,377 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-02-02 10:31:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:05,378 INFO L225 Difference]: With dead ends: 453 [2018-02-02 10:31:05,378 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 10:31:05,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:31:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 10:31:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 303. [2018-02-02 10:31:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 10:31:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 340 transitions. [2018-02-02 10:31:05,381 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 340 transitions. Word has length 64 [2018-02-02 10:31:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:05,381 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 340 transitions. [2018-02-02 10:31:05,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 340 transitions. [2018-02-02 10:31:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:31:05,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:05,382 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:05,382 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2074262367, now seen corresponding path program 2 times [2018-02-02 10:31:05,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:05,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:06,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:06,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:31:06,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:06,313 INFO L182 omatonBuilderFactory]: Interpolants [17437#true, 17438#false, 17439#(= 0 |main_#t~malloc0.offset|), 17440#(= 0 main_~bucket~0.offset), 17441#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 17442#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 17443#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 17444#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 |main_#t~mem5.offset|)), 17445#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bucket~0.offset 0) (= main_~bcki~0.offset 0)), 17446#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 17447#(and (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0) (= 0 |main_#t~malloc8.offset|)), 17448#(and (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= main_~bcki~0.offset 0)), 17449#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0) |main_#t~mem10.base|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 main_~bucket~0.offset) (= 0 |main_#t~mem10.offset|)), 17450#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (or (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= main_~bucket~0.offset main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 17451#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 0)) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0) (+ main_~bcki~0.offset 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset) main_~bcki~0.base))) (not (= main_~bucket~0.offset main_~bcki~0.offset)))), 17452#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)) (= 0 main_~bucket~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 0)))), 17453#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0)) (+ 0 4))) (not (= (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) 0)) (+ 0 4)))), 17454#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) 0)) (+ 0 4)))), 17455#(and (not (= |main_#t~mem36.base| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) 0)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) 0))), 17456#(and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (+ 0 4)))) (not (= 0 main_~bcki~0.offset))) (or (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (not (= 0 main_~bcki~0.offset)))), 17457#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (not (= 0 main_~bcki~0.offset))) (or (not (= 0 main_~bcki~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4)))))), 17458#(or (<= (+ main_~bcki~0.offset 4) 0) (and (or (not (= 0 main_~bucket~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))))) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (not (= 0 main_~bucket~0.offset))))), 17459#(and (or (= 0 |main_#t~mem36.offset|) (not (= 0 main_~bucket~0.offset))) (or (not (= 0 main_~bucket~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) (+ 0 4)))))), 17460#(and (or (not (= 0 main_~bucket~0.offset)) (= main_~bcki~0.offset 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (not (= 0 main_~bucket~0.offset)))), 17461#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= main_~bcki~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 17462#(and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|) (= main_~bcki~0.offset 0)), 17463#(and (= 0 main_~item~0.base) (= main_~bcki~0.offset 0) (= main_~item~0.offset 0)), 17464#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0))] [2018-02-02 10:31:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:06,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:31:06,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:31:06,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:31:06,314 INFO L87 Difference]: Start difference. First operand 303 states and 340 transitions. Second operand 28 states. [2018-02-02 10:31:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:08,206 INFO L93 Difference]: Finished difference Result 329 states and 358 transitions. [2018-02-02 10:31:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:31:08,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-02-02 10:31:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:08,207 INFO L225 Difference]: With dead ends: 329 [2018-02-02 10:31:08,207 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 10:31:08,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=550, Invalid=3610, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:31:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 10:31:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 310. [2018-02-02 10:31:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:31:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 347 transitions. [2018-02-02 10:31:08,210 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 347 transitions. Word has length 65 [2018-02-02 10:31:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:08,210 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 347 transitions. [2018-02-02 10:31:08,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:31:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 347 transitions. [2018-02-02 10:31:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:31:08,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:08,211 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:08,211 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 82203208, now seen corresponding path program 1 times [2018-02-02 10:31:08,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:08,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:09,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:31:09,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,451 INFO L182 omatonBuilderFactory]: Interpolants [18178#true, 18179#false, 18180#(= (select |#valid| 0) 0), 18181#(and (= 0 |main_#t~malloc0.offset|) (= (select |#valid| 0) 0)), 18182#(and (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset)), 18183#(and (= 1 (select |#valid| main_~bucket~0.base)) (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset)), 18184#(and (= (select |#valid| 0) 0) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 18185#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset)), 18186#(and (= 1 (select |#valid| main_~bucket~0.base)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 18187#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 1 (select |#valid| main_~bucket~0.base)) (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset)), 18188#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 1 (select |#valid| main_~bcki~0.base)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 1 (select |#valid| main_~bucket~0.base)) (= (select |#valid| 0) 0) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 18189#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= (select |#valid| 0) 0) (not (= main_~bcki~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (= 0 |main_#t~malloc8.offset|)), 18190#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= main_~bcki~0.offset (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)) (= (select |#valid| 0) 0) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 18191#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) |main_#t~mem10.base|) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 |main_#t~mem10.offset|)), 18192#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1) (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| 0) 0)))), 18193#(and (not (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base main_~bcki~0.base)) (or (and (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| 0) 0) (= (select |#valid| main_~bcki~0.base) 1)) (not (= main_~bucket~0.offset main_~bcki~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 18194#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) 1) (or (not (= main_~bucket~0.offset main_~bcki~0.offset)) (and (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0) (+ main_~bcki~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0) (+ main_~bcki~0.offset 4))) (= 1 (select |#valid| main_~bcki~0.base)) (= (select |#valid| 0) 0) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))) (= 0 main_~bucket~0.offset) (< main_~bcki~0.offset (+ main_~bucket~0.offset 1))), 18195#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (= (select |#valid| 0) 0) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 18196#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) |main_#t~malloc15.base|))) (= 1 (select |#valid| 0))) (= 0 main_~bucket~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~malloc15.base|))), 18197#(and (or (and (or (and (or (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (= 1 (select |#valid| 0))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))))) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= main_~bucket~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.base main_~item~0.base)) (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 18198#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset))) (+ main_~bucket~0.offset 4))))) (= main_~bucket~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.base main_~item~0.base))), 18199#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))) (and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (+ 0 4))) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (+ 0 4)))))) (and (= main_~bcki~0.offset 0) (= (select |#length| main_~bcki~0.base) 8))), 18200#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset)))) (and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (+ 0 4))) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))) (+ 0 4)))))), 18201#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset|)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|))) (and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|)) (+ 0 4))) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|)) (+ 0 4)))))), 18202#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)) (+ 0 4))) (= 1 (select |#valid| 0)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset))), 18203#(and (or (= 8 (select |#length| |main_#t~mem24.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) (+ 0 4))) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) (+ 0 4)))))) (= 0 |main_#t~mem24.offset|)), 18204#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4))))) (= (select |#length| main_~bcki~0.base) 8)) (= main_~bcki~0.offset 0)), 18205#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))) (= main_~bcki~0.offset 0)), 18206#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4))))), 18207#(and (= |main_#t~mem25.base| 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 1 (select |#valid| 0))) (= 0 |main_#t~mem25.offset|))), 18208#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 1 (select |#valid| 0))), 18209#(and (= 0 |main_#t~mem27.base|) (= 1 (select |#valid| 0))), 18210#(= 1 (select |#valid| main_~itr~0.base))] [2018-02-02 10:31:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:09,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:31:09,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:31:09,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:31:09,452 INFO L87 Difference]: Start difference. First operand 310 states and 347 transitions. Second operand 33 states. [2018-02-02 10:31:10,765 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 156 DAG size of output 102 [2018-02-02 10:31:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:13,004 INFO L93 Difference]: Finished difference Result 405 states and 443 transitions. [2018-02-02 10:31:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:31:13,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2018-02-02 10:31:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:13,005 INFO L225 Difference]: With dead ends: 405 [2018-02-02 10:31:13,005 INFO L226 Difference]: Without dead ends: 405 [2018-02-02 10:31:13,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=756, Invalid=4500, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 10:31:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-02 10:31:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 299. [2018-02-02 10:31:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:31:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 335 transitions. [2018-02-02 10:31:13,008 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 335 transitions. Word has length 65 [2018-02-02 10:31:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:13,008 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 335 transitions. [2018-02-02 10:31:13,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:31:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 335 transitions. [2018-02-02 10:31:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:31:13,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:13,009 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:13,009 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash 879650043, now seen corresponding path program 1 times [2018-02-02 10:31:13,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:13,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:13,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:13,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:31:13,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:13,679 INFO L182 omatonBuilderFactory]: Interpolants [19008#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19009#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19010#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (or (not (= main_~bucket~0.base |main_#t~malloc15.base|)) (and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19011#(and (or (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.base main_~item~0.base)) (or (and (= 8 (select |#length| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)))), 19012#(and (or (= main_~bucket~0.base main_~item~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))))) (or (not (= main_~bucket~0.base main_~item~0.base)) (and (= 8 (select |#length| main_~bucket~0.base)) (= main_~bcki~0.base main_~bucket~0.base) (= main_~bcki~0.offset 0)))), 19013#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= main_~bucket~0.base main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19014#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~mem24.base|)) (not (= main_~bucket~0.base main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19015#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.offset)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base main_~item~0.base))), 19016#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19017#(and (= 0 (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4)))), 19018#(and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|)), 19019#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 18995#true, 18996#false, 18997#(= 0 |main_#t~malloc0.offset|), 18998#(= 0 main_~bucket~0.offset), 18999#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 19000#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19001#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset |main_#t~malloc3.offset|) (+ main_~bucket~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset |main_#t~malloc3.base|) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 19002#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19003#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))), 19004#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19005#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 19006#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))), 19007#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))))] [2018-02-02 10:31:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:13,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:31:13,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:31:13,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:31:13,680 INFO L87 Difference]: Start difference. First operand 299 states and 335 transitions. Second operand 25 states. [2018-02-02 10:31:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:15,548 INFO L93 Difference]: Finished difference Result 437 states and 482 transitions. [2018-02-02 10:31:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:31:15,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2018-02-02 10:31:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:15,549 INFO L225 Difference]: With dead ends: 437 [2018-02-02 10:31:15,549 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 10:31:15,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=769, Invalid=3391, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:31:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 10:31:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 347. [2018-02-02 10:31:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 10:31:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 393 transitions. [2018-02-02 10:31:15,553 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 393 transitions. Word has length 68 [2018-02-02 10:31:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:15,553 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 393 transitions. [2018-02-02 10:31:15,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:31:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 393 transitions. [2018-02-02 10:31:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:31:15,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:15,554 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:15,554 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1628001066, now seen corresponding path program 1 times [2018-02-02 10:31:15,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:15,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:16,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:16,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:31:16,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:16,200 INFO L182 omatonBuilderFactory]: Interpolants [19904#(and (not (= 0 main_~bucket~0.base)) (= 1 (select (store |#valid| main_~bucket~0.base 0) |main_#t~mem36.base|))), 19905#(and (not (= 0 main_~bucket~0.base)) (= 1 (select (store |#valid| main_~bucket~0.base 0) main_~bcki~0.base))), 19906#(= 1 (select |#valid| main_~bcki~0.base)), 19884#true, 19885#false, 19886#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 19887#(and (= 12 (select |#length| main_~bucket~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 19888#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 12 (select |#length| main_~bucket~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 19889#(and (= (select |#length| main_~bucket~0.base) 12) (not (= 0 main_~bucket~0.base)) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 19890#(and (= (select |#length| main_~bucket~0.base) 12) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 19891#(and (= (select |#length| main_~bucket~0.base) 12) (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (not (= 0 main_~bucket~0.base)) (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem5.base|) (= 0 main_~bucket~0.offset)), 19892#(and (= (select |#length| main_~bucket~0.base) 12) (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 19893#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 19894#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 19895#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 19896#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 19897#(and (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 19898#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (or (not (= main_~bucket~0.base |main_#t~malloc15.base|)) (= 8 (select |#length| |main_#t~malloc15.base|))) (= 0 main_~bucket~0.offset)), 19899#(and (= 0 main_~bucket~0.offset) (or (= 8 (select |#length| main_~bucket~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (not (= 0 main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (= main_~bucket~0.base main_~item~0.base))), 19900#(and (or (and (= main_~bucket~0.base main_~item~0.base) (= 8 (select |#length| main_~bucket~0.base)) (= main_~bcki~0.base main_~bucket~0.base)) (and (not (= main_~bucket~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (not (= 0 main_~bucket~0.base)) (= main_~bcki~0.base main_~bucket~0.base))) (= main_~bucket~0.offset 0) (= main_~bcki~0.offset 0)), 19901#(and (not (= main_~bucket~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= main_~bucket~0.offset 0) (not (= 0 main_~bucket~0.base)) (= main_~bcki~0.base main_~bucket~0.base) (= main_~bcki~0.offset 0)), 19902#(and (not (= 0 main_~bcki~0.base)) (not (= main_~bcki~0.base (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)))), 19903#(and (= 1 (select (store |#valid| main_~bucket~0.base 0) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= 0 main_~bucket~0.base)))] [2018-02-02 10:31:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:16,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:31:16,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:31:16,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:16,200 INFO L87 Difference]: Start difference. First operand 347 states and 393 transitions. Second operand 23 states. [2018-02-02 10:31:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:17,725 INFO L93 Difference]: Finished difference Result 596 states and 649 transitions. [2018-02-02 10:31:17,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:31:17,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 10:31:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:17,726 INFO L225 Difference]: With dead ends: 596 [2018-02-02 10:31:17,726 INFO L226 Difference]: Without dead ends: 596 [2018-02-02 10:31:17,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=534, Invalid=2222, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:31:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-02-02 10:31:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 395. [2018-02-02 10:31:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 10:31:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 449 transitions. [2018-02-02 10:31:17,730 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 449 transitions. Word has length 71 [2018-02-02 10:31:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:17,730 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 449 transitions. [2018-02-02 10:31:17,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:31:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 449 transitions. [2018-02-02 10:31:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:31:17,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:17,730 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:17,730 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1628001065, now seen corresponding path program 1 times [2018-02-02 10:31:17,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:17,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:18,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:18,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:18,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:18,369 INFO L182 omatonBuilderFactory]: Interpolants [20960#(= 0 |main_#t~malloc0.offset|), 20961#(= 0 main_~bucket~0.offset), 20962#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 20963#(and (= 0 |main_#t~malloc3.offset|) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset) (= 12 (select |#length| |main_#t~malloc3.base|))), 20964#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 20965#(and (= (select |#valid| main_~bucket~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (= 12 (select |#length| |main_#t~mem5.base|)) (= (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset) |main_#t~mem5.base|) (= 0 main_~bucket~0.offset)), 20966#(and (= (select |#valid| main_~bucket~0.base) 1) (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 20967#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.offset|)) main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= main_~bcki~0.base (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 main_~bucket~0.offset)), 20968#(and (= main_~bcki~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| main_~bcki~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (= 0 main_~bucket~0.offset) (= (select |#valid| main_~bcki~0.base) 1)), 20969#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 20970#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 20971#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset)) 1)), 20972#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= 0 main_~bucket~0.offset)), 20973#(and (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (or (= main_~bucket~0.base main_~item~0.base) (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (= 0 main_~bucket~0.offset)), 20974#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= main_~bcki~0.base main_~bucket~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (or (and (= main_~bucket~0.offset 0) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.offset) main_~bucket~0.offset)) (= main_~bcki~0.base main_~bucket~0.base)) (= main_~bucket~0.base main_~item~0.base)) (= main_~bcki~0.offset 0)), 20975#(and (= main_~bucket~0.offset 0) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.offset) main_~bucket~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)) (= main_~bcki~0.base main_~bucket~0.base) (= main_~bcki~0.offset 0)), 20976#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~bucket~0.base) main_~bucket~0.offset)) (= main_~bucket~0.offset 0)), 20977#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset)))), 20978#(and (= 0 |main_#t~mem36.offset|) (= 12 (select |#length| |main_#t~mem36.base|))), 20979#(and (= (select |#length| main_~bcki~0.base) 12) (= 0 main_~bcki~0.offset)), 20958#true, 20959#false] [2018-02-02 10:31:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:18,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:18,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:18,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:18,369 INFO L87 Difference]: Start difference. First operand 395 states and 449 transitions. Second operand 22 states. [2018-02-02 10:31:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:19,475 INFO L93 Difference]: Finished difference Result 517 states and 577 transitions. [2018-02-02 10:31:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:31:19,475 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-02-02 10:31:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:19,476 INFO L225 Difference]: With dead ends: 517 [2018-02-02 10:31:19,477 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 10:31:19,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=383, Invalid=1873, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:31:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 10:31:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 446. [2018-02-02 10:31:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 10:31:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 513 transitions. [2018-02-02 10:31:19,480 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 513 transitions. Word has length 71 [2018-02-02 10:31:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:19,480 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 513 transitions. [2018-02-02 10:31:19,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:31:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 513 transitions. [2018-02-02 10:31:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:31:19,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:19,481 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:19,481 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1281312038, now seen corresponding path program 1 times [2018-02-02 10:31:19,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:19,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:19,753 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 30 DAG size of output 25 [2018-02-02 10:31:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:20,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:20,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:20,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:20,107 INFO L182 omatonBuilderFactory]: Interpolants [21995#true, 21996#false, 21997#(= 0 |main_#t~malloc0.offset|), 21998#(= 0 main_~bucket~0.offset), 21999#(and (or (not (= main_~bucket~0.base |main_#t~malloc15.base|)) (= 8 (select |#length| |main_#t~malloc15.base|))) (= 0 main_~bucket~0.offset) (or (= main_~bucket~0.base |main_#t~malloc15.base|) (= 0 |main_#t~malloc15.offset|))), 22000#(and (= 0 main_~bucket~0.offset) (or (and (not (= main_~bucket~0.base main_~item~0.base)) (= main_~item~0.offset 0)) (= 8 (select |#length| main_~bucket~0.base)))), 22001#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)) (= main_~item~0.offset 0)) (= 8 (select |#length| main_~bucket~0.base))) (= 0 main_~bucket~0.offset)), 22002#(and (or (and (= main_~bucket~0.offset main_~bcki~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.offset)) main_~item~0.base) main_~item~0.offset)) (not (= main_~bucket~0.base main_~item~0.base)) (= main_~bcki~0.base main_~bucket~0.base) (= main_~item~0.offset 0)) (= 8 (select |#length| main_~bucket~0.base))) (= 0 main_~bucket~0.offset)), 22003#(and (or (and (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~bucket~0.base) (+ main_~bucket~0.offset 4))) 0))) (= 8 (select |#length| main_~bucket~0.base))) (= 0 main_~bucket~0.offset)), 22004#(and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) (select (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4))) 0))) (= (select |#length| main_~bcki~0.base) 8)) (= main_~bcki~0.offset 0)), 22005#(and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) |main_#t~mem31.base|) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) |main_#t~mem31.base|) 0))) (= (select |#length| main_~bcki~0.base) 8)) (= main_~bcki~0.offset 0)), 22006#(and (= main_~bcki~0.offset 0) (or (not (= 0 main_~item~0.offset)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~bcki~0.base (store (select |#memory_$Pointer$.offset| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0)) main_~item~0.base) main_~item~0.offset))) (= (select |#length| main_~bcki~0.base) 8))), 22007#(and (= main_~bcki~0.offset 0) (or (not (= 0 main_~itr~0.offset)) (= (select |#length| main_~bcki~0.base) 8) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 22008#(and (or (and (= 0 |main_#t~mem33.offset|) (= 0 |main_#t~mem33.base|)) (not (= 0 main_~itr~0.offset)) (= (select |#length| main_~bcki~0.base) 8)) (= main_~bcki~0.offset 0)), 22009#(and (= main_~bcki~0.offset 0) (or (and (= 0 main_~item~0.base) (= main_~item~0.offset 0)) (not (= 0 main_~itr~0.offset)) (= (select |#length| main_~bcki~0.base) 8))), 22010#(or (and (= 0 main_~item~0.base) (= main_~item~0.offset 0)) (not (= 0 main_~itr~0.offset))), 22011#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0))] [2018-02-02 10:31:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:20,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:20,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:20,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:20,108 INFO L87 Difference]: Start difference. First operand 446 states and 513 transitions. Second operand 17 states. [2018-02-02 10:31:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:21,531 INFO L93 Difference]: Finished difference Result 578 states and 653 transitions. [2018-02-02 10:31:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:31:21,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-02-02 10:31:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:21,532 INFO L225 Difference]: With dead ends: 578 [2018-02-02 10:31:21,532 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 10:31:21,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=394, Invalid=1586, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:31:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 10:31:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 440. [2018-02-02 10:31:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 10:31:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 501 transitions. [2018-02-02 10:31:21,535 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 501 transitions. Word has length 71 [2018-02-02 10:31:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:21,535 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 501 transitions. [2018-02-02 10:31:21,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 501 transitions. [2018-02-02 10:31:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:31:21,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:21,536 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:21,536 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1071575320, now seen corresponding path program 1 times [2018-02-02 10:31:21,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:21,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:21,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:21,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:21,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:21,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-02 10:31:21,934 INFO L182 omatonBuilderFactory]: Interpolants [23104#(not (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) 0) main_~bcki~0.offset))), 23105#(not (= 0 |main_#t~mem36.base|)), 23106#(not (= 0 main_~bcki~0.base)), 23086#true, 23087#false, 23088#(= 0 |main_#t~malloc0.offset|), 23089#(= 0 main_~bucket~0.offset), 23090#(and (= 1 (select |#valid| main_~bucket~0.base)) (= 0 main_~bucket~0.offset)), 23091#(and (not (= 0 |main_#t~malloc3.base|)) (not (= main_~bucket~0.base |main_#t~malloc3.base|)) (= 0 main_~bucket~0.offset)), 23092#(and (= 1 (select |#valid| main_~bucket~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23093#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base |main_#t~mem5.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23094#(and (= (select |#valid| main_~bucket~0.base) 1) (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23095#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base |main_#t~malloc8.base|)) (= 0 main_~bucket~0.offset) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~bcki~0.base (store (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset |main_#t~malloc8.base|)) main_~bucket~0.base) main_~bucket~0.offset)))), 23096#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= main_~bucket~0.base (select (select |#memory_$Pointer$.base| main_~bcki~0.base) main_~bcki~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23097#(and (not (= main_~bucket~0.base |main_#t~mem10.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23098#(and (not (= main_~bucket~0.base main_~bcki~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23099#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23100#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~bucket~0.base) main_~bucket~0.offset))) (= 0 main_~bucket~0.offset)), 23101#(and (or (= 8 (select |#length| main_~item~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (or (= main_~bucket~0.base main_~item~0.base) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~bucket~0.base) main_~bucket~0.offset)))) (= 0 main_~bucket~0.offset)), 23102#(and (or (and (= 8 (select |#length| main_~item~0.base)) (= main_~bcki~0.base main_~bucket~0.base)) (not (= main_~bucket~0.base main_~item~0.base))) (= main_~bucket~0.offset 0) (or (and (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= main_~bcki~0.base main_~bucket~0.base)) (= main_~bucket~0.base main_~item~0.base)) (= main_~bcki~0.offset 0)), 23103#(and (= main_~bucket~0.offset 0) (not (= main_~bucket~0.base main_~item~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~bcki~0.base) (+ main_~bcki~0.offset 4) main_~item~0.base) main_~bucket~0.offset))) (= main_~bcki~0.base main_~bucket~0.base) (= main_~bcki~0.offset 0))] [2018-02-02 10:31:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:21,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:31:21,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:31:21,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:31:21,935 INFO L87 Difference]: Start difference. First operand 440 states and 501 transitions. Second operand 21 states. Received shutdown request... [2018-02-02 10:31:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:31:22,705 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:31:22,711 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:31:22,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:31:22 BoogieIcfgContainer [2018-02-02 10:31:22,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:31:22,712 INFO L168 Benchmark]: Toolchain (without parser) took 54165.55 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 750.8 MB). Free memory was 353.0 MB in the beginning and 738.8 MB in the end (delta: -385.7 MB). Peak memory consumption was 365.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:22,713 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:31:22,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.63 ms. Allocated memory is still 399.0 MB. Free memory was 353.0 MB in the beginning and 341.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:22,714 INFO L168 Benchmark]: Boogie Preprocessor took 32.58 ms. Allocated memory is still 399.0 MB. Free memory was 341.1 MB in the beginning and 338.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:22,714 INFO L168 Benchmark]: RCFGBuilder took 424.14 ms. Allocated memory is still 399.0 MB. Free memory was 338.4 MB in the beginning and 297.4 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:22,714 INFO L168 Benchmark]: TraceAbstraction took 53531.01 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 750.8 MB). Free memory was 296.1 MB in the beginning and 738.8 MB in the end (delta: -442.7 MB). Peak memory consumption was 308.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:31:22,715 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.19 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.63 ms. Allocated memory is still 399.0 MB. Free memory was 353.0 MB in the beginning and 341.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.58 ms. Allocated memory is still 399.0 MB. Free memory was 341.1 MB in the beginning and 338.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 424.14 ms. Allocated memory is still 399.0 MB. Free memory was 338.4 MB in the beginning and 297.4 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53531.01 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 750.8 MB). Free memory was 296.1 MB in the beginning and 738.8 MB in the end (delta: -442.7 MB). Peak memory consumption was 308.1 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 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1056). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1056). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (440states) and interpolant automaton (currently 29 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 156 locations, 65 error locations. TIMEOUT Result, 53.4s OverallTime, 39 OverallIterations, 4 TraceHistogramMax, 37.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3606 SDtfs, 24355 SDslu, 25418 SDs, 0 SdLazy, 31543 SolverSat, 3984 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 71 SyntacticMatches, 151 SemanticMatches, 1275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13848 ImplicationChecksByTransitivity, 31.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 53/241 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 2859 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1818 ConstructedInterpolants, 0 QuantifiedInterpolants, 2542123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 53/241 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/sll-buckets_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-31-22-721.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-31-22-721.csv Completed graceful shutdown