java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:09:33,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:09:33,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:09:33,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:09:33,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:09:33,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:09:33,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:09:33,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:09:33,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:09:33,999 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:09:33,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:09:34,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:09:34,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:09:34,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:09:34,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:09:34,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:09:34,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:09:34,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:09:34,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:09:34,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:09:34,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:09:34,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:09:34,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:09:34,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:09:34,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:09:34,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:09:34,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:09:34,017 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:09:34,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:09:34,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:09:34,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:09:34,018 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:09:34,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:09:34,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:09:34,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:09:34,029 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:09:34,030 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:09:34,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:09:34,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:09:34,030 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:09:34,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:09:34,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:09:34,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:09:34,031 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:09:34,031 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:09:34,031 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:09:34,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:09:34,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:09:34,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:09:34,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:09:34,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:09:34,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:09:34,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:09:34,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:09:34,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:09:34,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:09:34,073 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:09:34,076 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:09:34,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:09:34,077 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:09:34,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-02-02 20:09:34,210 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:09:34,211 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:09:34,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:09:34,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:09:34,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:09:34,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34, skipping insertion in model container [2018-02-02 20:09:34,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,238 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:09:34,269 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:09:34,370 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:09:34,390 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:09:34,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34 WrapperNode [2018-02-02 20:09:34,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:09:34,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:09:34,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:09:34,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:09:34,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (1/1) ... [2018-02-02 20:09:34,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:09:34,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:09:34,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:09:34,434 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:09:34,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (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 20:09:34,476 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:09:34,476 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:09:34,476 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:09:34,476 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:09:34,476 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:09:34,476 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:09:34,476 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:09:34,476 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:09:34,477 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:09:34,477 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:09:34,477 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:09:34,477 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:09:34,477 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:09:34,477 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:09:34,948 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:09:34,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:09:34 BoogieIcfgContainer [2018-02-02 20:09:34,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:09:34,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:09:34,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:09:34,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:09:34,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:09:34" (1/3) ... [2018-02-02 20:09:34,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3465e389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:09:34, skipping insertion in model container [2018-02-02 20:09:34,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:34" (2/3) ... [2018-02-02 20:09:34,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3465e389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:09:34, skipping insertion in model container [2018-02-02 20:09:34,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:09:34" (3/3) ... [2018-02-02 20:09:34,954 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-02-02 20:09:34,959 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:09:34,965 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-02-02 20:09:34,988 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:09:34,988 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:09:34,988 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:09:34,988 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:09:34,988 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:09:34,988 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:09:34,988 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:09:34,988 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:09:34,989 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:09:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-02-02 20:09:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:09:35,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,010 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:35,011 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684078, now seen corresponding path program 1 times [2018-02-02 20:09:35,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:35,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,136 INFO L182 omatonBuilderFactory]: Interpolants [224#false, 225#(= 1 (select |#valid| |main_#t~malloc0.base|)), 226#(= 1 (select |#valid| main_~tree~0.base)), 223#true] [2018-02-02 20:09:35,136 INFO 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 20:09:35,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:35,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:35,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:35,151 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2018-02-02 20:09:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,569 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-02-02 20:09:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:35,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:09:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,585 INFO L225 Difference]: With dead ends: 325 [2018-02-02 20:09:35,585 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 20:09:35,586 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 20:09:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 20:09:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-02 20:09:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 20:09:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-02-02 20:09:35,631 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 8 [2018-02-02 20:09:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,632 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-02-02 20:09:35,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-02-02 20:09:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:09:35,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:35,633 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684077, now seen corresponding path program 1 times [2018-02-02 20:09:35,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,688 INFO 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 20:09:35,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:35,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,689 INFO 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 20:09:35,689 INFO L182 omatonBuilderFactory]: Interpolants [762#true, 763#false, 764#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 765#(and (= main_~tree~0.offset 0) (= (select |#length| main_~tree~0.base) 12))] [2018-02-02 20:09:35,689 INFO 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 20:09:35,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:35,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:35,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:35,690 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 4 states. [2018-02-02 20:09:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,853 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-02-02 20:09:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:35,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:09:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,854 INFO L225 Difference]: With dead ends: 206 [2018-02-02 20:09:35,854 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 20:09:35,855 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 20:09:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 20:09:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-02 20:09:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:09:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-02-02 20:09:35,863 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 8 [2018-02-02 20:09:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,863 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-02-02 20:09:35,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-02-02 20:09:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 20:09:35,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,864 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:35,864 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1863813244, now seen corresponding path program 1 times [2018-02-02 20:09:35,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,932 INFO 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 20:09:35,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:35,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,932 INFO 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 20:09:35,932 INFO L182 omatonBuilderFactory]: Interpolants [1184#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base))), 1180#true, 1181#false, 1182#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1183#(and (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base)))] [2018-02-02 20:09:35,932 INFO 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 20:09:35,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:35,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:35,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:35,933 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 5 states. [2018-02-02 20:09:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,287 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2018-02-02 20:09:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:09:36,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 20:09:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,288 INFO L225 Difference]: With dead ends: 355 [2018-02-02 20:09:36,289 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 20:09:36,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 20:09:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 20:09:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 199. [2018-02-02 20:09:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:09:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-02-02 20:09:36,299 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 11 [2018-02-02 20:09:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,299 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-02-02 20:09:36,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-02-02 20:09:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:09:36,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,299 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:36,300 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash -476893285, now seen corresponding path program 1 times [2018-02-02 20:09:36,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:36,346 INFO 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 20:09:36,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:36,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:36,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:36,347 INFO 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 20:09:36,347 INFO L182 omatonBuilderFactory]: Interpolants [1744#false, 1745#(= 1 (select |#valid| |main_#t~malloc3.base|)), 1746#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 1747#(= 1 (select |#valid| |main_#t~mem5.base|)), 1743#true] [2018-02-02 20:09:36,347 INFO 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 20:09:36,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:36,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:36,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:36,347 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 5 states. [2018-02-02 20:09:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,524 INFO L93 Difference]: Finished difference Result 274 states and 296 transitions. [2018-02-02 20:09:36,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:36,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:09:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,525 INFO L225 Difference]: With dead ends: 274 [2018-02-02 20:09:36,525 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 20:09:36,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 20:09:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 198. [2018-02-02 20:09:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 20:09:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-02-02 20:09:36,531 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 14 [2018-02-02 20:09:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,531 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-02-02 20:09:36,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-02-02 20:09:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:09:36,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,532 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:36,532 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash -476893284, now seen corresponding path program 1 times [2018-02-02 20:09:36,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:36,580 INFO 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 20:09:36,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:36,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:36,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:36,581 INFO 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 20:09:36,582 INFO L182 omatonBuilderFactory]: Interpolants [2226#true, 2227#false, 2228#(and (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 2229#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2230#(and (= (select |#length| |main_#t~mem5.base|) 4) (= |main_#t~mem5.offset| 0))] [2018-02-02 20:09:36,582 INFO 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 20:09:36,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:36,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:36,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:36,582 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 5 states. [2018-02-02 20:09:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,805 INFO L93 Difference]: Finished difference Result 315 states and 345 transitions. [2018-02-02 20:09:36,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:36,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:09:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,807 INFO L225 Difference]: With dead ends: 315 [2018-02-02 20:09:36,807 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 20:09:36,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 20:09:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 197. [2018-02-02 20:09:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 20:09:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-02-02 20:09:36,813 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 14 [2018-02-02 20:09:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,813 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-02-02 20:09:36,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-02-02 20:09:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:09:36,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,814 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] [2018-02-02 20:09:36,814 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405160, now seen corresponding path program 1 times [2018-02-02 20:09:36,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:36,915 INFO 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 20:09:36,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:36,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:09:36,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:36,916 INFO 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 20:09:36,916 INFO L182 omatonBuilderFactory]: Interpolants [2752#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= main_~tree~0.base |main_#t~malloc3.base|))), 2753#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2754#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2755#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 2756#(= 1 (select |#valid| |main_#t~mem10.base|)), 2749#true, 2750#false, 2751#(= 1 (select |#valid| main_~tree~0.base))] [2018-02-02 20:09:36,916 INFO 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 20:09:36,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:09:36,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:09:36,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:36,917 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 8 states. [2018-02-02 20:09:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:37,468 INFO L93 Difference]: Finished difference Result 369 states and 405 transitions. [2018-02-02 20:09:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:09:37,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 20:09:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:37,469 INFO L225 Difference]: With dead ends: 369 [2018-02-02 20:09:37,469 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 20:09:37,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 20:09:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 204. [2018-02-02 20:09:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:09:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2018-02-02 20:09:37,473 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 22 [2018-02-02 20:09:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:37,473 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2018-02-02 20:09:37,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:09:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2018-02-02 20:09:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:09:37,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:37,474 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] [2018-02-02 20:09:37,474 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405161, now seen corresponding path program 1 times [2018-02-02 20:09:37,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:37,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:37,646 INFO 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 20:09:37,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:37,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:09:37,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:37,647 INFO 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 20:09:37,647 INFO L182 omatonBuilderFactory]: Interpolants [3344#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 3345#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem5.base|))), 3346#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 3347#(and (= |main_#t~mem10.offset| 0) (= (select |#length| |main_#t~mem10.base|) 4)), 3340#true, 3341#false, 3342#(= 1 (select |#valid| main_~tree~0.base)), 3343#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|)))] [2018-02-02 20:09:37,648 INFO 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 20:09:37,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:09:37,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:09:37,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:37,648 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand 8 states. [2018-02-02 20:09:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:38,338 INFO L93 Difference]: Finished difference Result 555 states and 611 transitions. [2018-02-02 20:09:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:09:38,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 20:09:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:38,340 INFO L225 Difference]: With dead ends: 555 [2018-02-02 20:09:38,340 INFO L226 Difference]: Without dead ends: 555 [2018-02-02 20:09:38,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-02 20:09:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 204. [2018-02-02 20:09:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:09:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2018-02-02 20:09:38,346 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 22 [2018-02-02 20:09:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:38,346 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2018-02-02 20:09:38,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:09:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2018-02-02 20:09:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:09:38,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:38,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:38,347 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash -115400475, now seen corresponding path program 1 times [2018-02-02 20:09:38,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:38,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:38,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:38,382 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:38,383 INFO 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 20:09:38,383 INFO L182 omatonBuilderFactory]: Interpolants [4117#true, 4118#false, 4119#(= (select |#valid| main_~tree~0.base) 1), 4120#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-02 20:09:38,383 INFO 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 20:09:38,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:38,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:38,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:38,384 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand 4 states. [2018-02-02 20:09:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:38,506 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-02 20:09:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:38,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:09:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:38,507 INFO L225 Difference]: With dead ends: 273 [2018-02-02 20:09:38,507 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 20:09:38,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 20:09:38,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 20:09:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2018-02-02 20:09:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 20:09:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-02 20:09:38,511 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 23 [2018-02-02 20:09:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:38,511 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-02 20:09:38,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-02 20:09:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:09:38,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:38,512 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:38,512 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:38,512 INFO L82 PathProgramCache]: Analyzing trace with hash -115400474, now seen corresponding path program 1 times [2018-02-02 20:09:38,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:38,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:38,607 INFO 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 20:09:38,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:38,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:09:38,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:38,608 INFO 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 20:09:38,608 INFO L182 omatonBuilderFactory]: Interpolants [4593#true, 4594#false, 4595#(= 0 |main_#t~malloc0.offset|), 4596#(= 0 main_~tree~0.offset), 4597#(and (= 0 main_~tree~0.offset) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 4598#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0))] [2018-02-02 20:09:38,608 INFO 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 20:09:38,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:09:38,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:09:38,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:09:38,608 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 6 states. [2018-02-02 20:09:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:38,862 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2018-02-02 20:09:38,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:09:38,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 20:09:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:38,864 INFO L225 Difference]: With dead ends: 464 [2018-02-02 20:09:38,864 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 20:09:38,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:09:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 20:09:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 346. [2018-02-02 20:09:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 20:09:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2018-02-02 20:09:38,868 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 23 [2018-02-02 20:09:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:38,869 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2018-02-02 20:09:38,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:09:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2018-02-02 20:09:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:09:38,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:38,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:38,869 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash -81080279, now seen corresponding path program 1 times [2018-02-02 20:09:38,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:38,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:38,905 INFO 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 20:09:38,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:38,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:38,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:38,906 INFO 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 20:09:38,906 INFO L182 omatonBuilderFactory]: Interpolants [5417#true, 5418#false, 5419#(and (= 0 |main_#t~malloc9.offset|) (= 4 (select |#length| |main_#t~malloc9.base|))), 5420#(and (= (select |#length| main_~tmpList~0.base) 4) (= main_~tmpList~0.offset 0))] [2018-02-02 20:09:38,906 INFO 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 20:09:38,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:38,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:38,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:38,907 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand 4 states. [2018-02-02 20:09:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:39,141 INFO L93 Difference]: Finished difference Result 701 states and 998 transitions. [2018-02-02 20:09:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:39,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:09:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:39,143 INFO L225 Difference]: With dead ends: 701 [2018-02-02 20:09:39,144 INFO L226 Difference]: Without dead ends: 701 [2018-02-02 20:09:39,144 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 20:09:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-02 20:09:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 345. [2018-02-02 20:09:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 20:09:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2018-02-02 20:09:39,152 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 23 [2018-02-02 20:09:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:39,153 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2018-02-02 20:09:39,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2018-02-02 20:09:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:09:39,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:39,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:39,153 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -81080280, now seen corresponding path program 1 times [2018-02-02 20:09:39,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:39,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:39,178 INFO 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 20:09:39,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:39,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:39,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:39,178 INFO 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 20:09:39,179 INFO L182 omatonBuilderFactory]: Interpolants [6470#true, 6471#false, 6472#(= 1 (select |#valid| |main_#t~malloc9.base|)), 6473#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-02 20:09:39,179 INFO 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 20:09:39,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:39,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:39,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:39,179 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand 4 states. [2018-02-02 20:09:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:39,444 INFO L93 Difference]: Finished difference Result 861 states and 1188 transitions. [2018-02-02 20:09:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:39,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:09:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:39,450 INFO L225 Difference]: With dead ends: 861 [2018-02-02 20:09:39,450 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 20:09:39,451 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 20:09:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 20:09:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 343. [2018-02-02 20:09:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 20:09:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2018-02-02 20:09:39,459 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 23 [2018-02-02 20:09:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:39,460 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2018-02-02 20:09:39,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-02-02 20:09:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:09:39,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:39,463 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] [2018-02-02 20:09:39,463 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash 771701702, now seen corresponding path program 1 times [2018-02-02 20:09:39,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:39,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:39,485 INFO 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 20:09:39,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:39,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:39,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:39,486 INFO 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 20:09:39,486 INFO L182 omatonBuilderFactory]: Interpolants [7681#true, 7682#false, 7683#(not (= 0 |main_#t~malloc0.base|)), 7684#(not (= 0 main_~tree~0.base))] [2018-02-02 20:09:39,486 INFO 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 20:09:39,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:39,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:39,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:39,487 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand 4 states. [2018-02-02 20:09:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:39,513 INFO L93 Difference]: Finished difference Result 413 states and 541 transitions. [2018-02-02 20:09:39,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:39,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-02 20:09:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:39,515 INFO L225 Difference]: With dead ends: 413 [2018-02-02 20:09:39,515 INFO L226 Difference]: Without dead ends: 413 [2018-02-02 20:09:39,515 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 20:09:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-02 20:09:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 382. [2018-02-02 20:09:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 20:09:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2018-02-02 20:09:39,521 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 25 [2018-02-02 20:09:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:39,522 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2018-02-02 20:09:39,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2018-02-02 20:09:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:09:39,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:39,523 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] [2018-02-02 20:09:39,523 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982226, now seen corresponding path program 1 times [2018-02-02 20:09:39,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:39,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:39,592 INFO 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 20:09:39,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:39,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:39,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:39,593 INFO 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 20:09:39,593 INFO L182 omatonBuilderFactory]: Interpolants [8482#true, 8483#false, 8484#(= (select |#valid| main_~tree~0.base) 1), 8485#(not (= main_~tree~0.base |main_#t~malloc9.base|)), 8486#(not (= main_~tree~0.base main_~tmpList~0.base)), 8487#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 8488#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 8489#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 8490#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 20:09:39,593 INFO 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 20:09:39,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:39,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:39,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:39,594 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand 9 states. [2018-02-02 20:09:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:40,196 INFO L93 Difference]: Finished difference Result 1251 states and 1782 transitions. [2018-02-02 20:09:40,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:09:40,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 20:09:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:40,199 INFO L225 Difference]: With dead ends: 1251 [2018-02-02 20:09:40,199 INFO L226 Difference]: Without dead ends: 1251 [2018-02-02 20:09:40,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:09:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-02-02 20:09:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 381. [2018-02-02 20:09:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 20:09:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 540 transitions. [2018-02-02 20:09:40,206 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 540 transitions. Word has length 26 [2018-02-02 20:09:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:40,206 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 540 transitions. [2018-02-02 20:09:40,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 540 transitions. [2018-02-02 20:09:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:09:40,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:40,207 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] [2018-02-02 20:09:40,207 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982225, now seen corresponding path program 1 times [2018-02-02 20:09:40,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:40,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:40,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:40,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:40,296 INFO 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 20:09:40,296 INFO L182 omatonBuilderFactory]: Interpolants [10144#(not (= main_~tree~0.base |main_#t~malloc9.base|)), 10145#(not (= main_~tree~0.base main_~tmpList~0.base)), 10146#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 10147#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 10148#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 10149#(and (<= 0 |main_#t~mem13.offset|) (<= (+ |main_#t~mem13.offset| 4) (select |#length| |main_#t~mem13.base|))), 10141#true, 10142#false, 10143#(= (select |#valid| main_~tree~0.base) 1)] [2018-02-02 20:09:40,296 INFO 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 20:09:40,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:40,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:40,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:40,296 INFO L87 Difference]: Start difference. First operand 381 states and 540 transitions. Second operand 9 states. [2018-02-02 20:09:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:40,847 INFO L93 Difference]: Finished difference Result 1250 states and 1781 transitions. [2018-02-02 20:09:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:09:40,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 20:09:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:40,850 INFO L225 Difference]: With dead ends: 1250 [2018-02-02 20:09:40,850 INFO L226 Difference]: Without dead ends: 1250 [2018-02-02 20:09:40,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:09:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-02-02 20:09:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 380. [2018-02-02 20:09:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 20:09:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 539 transitions. [2018-02-02 20:09:40,860 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 539 transitions. Word has length 26 [2018-02-02 20:09:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:40,860 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 539 transitions. [2018-02-02 20:09:40,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 539 transitions. [2018-02-02 20:09:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:09:40,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:40,861 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 20:09:40,861 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash -679017658, now seen corresponding path program 1 times [2018-02-02 20:09:40,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:40,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:40,885 INFO 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 20:09:40,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:40,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:40,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:40,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 20:09:40,886 INFO L182 omatonBuilderFactory]: Interpolants [11798#true, 11799#false, 11800#|main_#t~short49|] [2018-02-02 20:09:40,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 20:09:40,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:09:40,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:09:40,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:40,887 INFO L87 Difference]: Start difference. First operand 380 states and 539 transitions. Second operand 3 states. [2018-02-02 20:09:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:40,894 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2018-02-02 20:09:40,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:09:40,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 20:09:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:40,896 INFO L225 Difference]: With dead ends: 384 [2018-02-02 20:09:40,896 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 20:09:40,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 20:09:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-02-02 20:09:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 20:09:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 543 transitions. [2018-02-02 20:09:40,902 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 543 transitions. Word has length 30 [2018-02-02 20:09:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:40,902 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 543 transitions. [2018-02-02 20:09:40,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:09:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 543 transitions. [2018-02-02 20:09:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:09:40,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:40,903 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] [2018-02-02 20:09:40,903 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1240786582, now seen corresponding path program 1 times [2018-02-02 20:09:40,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:40,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:40,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:40,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:40,921 INFO 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 20:09:40,921 INFO L182 omatonBuilderFactory]: Interpolants [12569#true, 12570#false, 12571#(not |main_#t~short18|)] [2018-02-02 20:09:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:09:40,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:09:40,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:40,922 INFO L87 Difference]: Start difference. First operand 384 states and 543 transitions. Second operand 3 states. [2018-02-02 20:09:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:40,929 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2018-02-02 20:09:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:09:40,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-02 20:09:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:40,930 INFO L225 Difference]: With dead ends: 387 [2018-02-02 20:09:40,930 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 20:09:40,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 20:09:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-02 20:09:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 20:09:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 546 transitions. [2018-02-02 20:09:40,936 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 546 transitions. Word has length 31 [2018-02-02 20:09:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:40,937 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 546 transitions. [2018-02-02 20:09:40,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:09:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 546 transitions. [2018-02-02 20:09:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:09:40,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:40,938 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] [2018-02-02 20:09:40,938 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash 348971873, now seen corresponding path program 1 times [2018-02-02 20:09:40,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:40,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:40,960 INFO 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 20:09:40,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:40,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:40,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,961 INFO L182 omatonBuilderFactory]: Interpolants [13346#true, 13347#false, 13348#(and (= main_~pred~0.base 0) (= main_~pred~0.offset 0))] [2018-02-02 20:09:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:09:40,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:09:40,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:40,962 INFO L87 Difference]: Start difference. First operand 387 states and 546 transitions. Second operand 3 states. [2018-02-02 20:09:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:40,975 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2018-02-02 20:09:40,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:09:40,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-02 20:09:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:40,977 INFO L225 Difference]: With dead ends: 428 [2018-02-02 20:09:40,977 INFO L226 Difference]: Without dead ends: 428 [2018-02-02 20:09:40,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-02 20:09:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 379. [2018-02-02 20:09:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-02 20:09:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 526 transitions. [2018-02-02 20:09:40,983 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 526 transitions. Word has length 32 [2018-02-02 20:09:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:40,983 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 526 transitions. [2018-02-02 20:09:40,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:09:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 526 transitions. [2018-02-02 20:09:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:09:40,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:40,984 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] [2018-02-02 20:09:40,984 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1663635795, now seen corresponding path program 1 times [2018-02-02 20:09:40,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:40,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:41,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:41,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:09:41,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:41,135 INFO L182 omatonBuilderFactory]: Interpolants [14160#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 14161#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 14162#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 14163#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 14164#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 14165#(not |main_#t~short18|), 14156#true, 14157#false, 14158#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 14159#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset)))] [2018-02-02 20:09:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:41,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:09:41,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:09:41,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:09:41,135 INFO L87 Difference]: Start difference. First operand 379 states and 526 transitions. Second operand 10 states. [2018-02-02 20:09:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:41,579 INFO L93 Difference]: Finished difference Result 605 states and 777 transitions. [2018-02-02 20:09:41,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:09:41,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-02 20:09:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:41,580 INFO L225 Difference]: With dead ends: 605 [2018-02-02 20:09:41,580 INFO L226 Difference]: Without dead ends: 605 [2018-02-02 20:09:41,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:09:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-02 20:09:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 396. [2018-02-02 20:09:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 20:09:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 548 transitions. [2018-02-02 20:09:41,586 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 548 transitions. Word has length 33 [2018-02-02 20:09:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:41,586 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 548 transitions. [2018-02-02 20:09:41,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:09:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 548 transitions. [2018-02-02 20:09:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:09:41,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:41,593 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] [2018-02-02 20:09:41,594 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 768774257, now seen corresponding path program 1 times [2018-02-02 20:09:41,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:41,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:41,827 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 20:09:41,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:41,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:41,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:41,827 INFO 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 20:09:41,828 INFO L182 omatonBuilderFactory]: Interpolants [15181#true, 15182#false, 15183#(= (select |#valid| 0) 0), 15184#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= (select |#valid| 0) 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 15185#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (or (= 1 (select |#valid| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset)))), 15186#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 15187#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0))) (not (= main_~tree~0.base |main_#t~mem5.base|))), 15188#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0)))), 15189#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0)))), 15190#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem47.base|) (= |main_#t~mem47.base| 0) (or (= 0 |main_#t~mem47.offset|) (= 1 (select |#valid| 0)))), 15191#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))) (not |main_#t~short49|)), 15192#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))), 15193#(and (= 0 |main_#t~mem51.base|) (= 1 (select |#valid| 0))), 15194#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-02 20:09:41,828 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 20:09:41,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:41,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:41,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:41,828 INFO L87 Difference]: Start difference. First operand 396 states and 548 transitions. Second operand 14 states. [2018-02-02 20:09:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:42,874 INFO L93 Difference]: Finished difference Result 609 states and 779 transitions. [2018-02-02 20:09:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:09:42,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 20:09:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:42,876 INFO L225 Difference]: With dead ends: 609 [2018-02-02 20:09:42,876 INFO L226 Difference]: Without dead ends: 609 [2018-02-02 20:09:42,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:09:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-02 20:09:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 441. [2018-02-02 20:09:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-02-02 20:09:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 623 transitions. [2018-02-02 20:09:42,880 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 623 transitions. Word has length 34 [2018-02-02 20:09:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:42,880 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 623 transitions. [2018-02-02 20:09:42,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 623 transitions. [2018-02-02 20:09:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:09:42,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:42,880 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] [2018-02-02 20:09:42,880 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash -700463843, now seen corresponding path program 1 times [2018-02-02 20:09:42,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:42,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:43,035 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 20:09:43,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:43,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:09:43,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:43,035 INFO 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 20:09:43,036 INFO L182 omatonBuilderFactory]: Interpolants [16288#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 16289#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16290#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16291#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16292#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16293#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16294#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 16295#(= 1 (select |#valid| |main_#t~mem10.base|)), 16283#true, 16284#false, 16285#(= 1 (select |#valid| main_~tree~0.base)), 16286#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 16287#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-02 20:09:43,036 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 20:09:43,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:09:43,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:09:43,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:43,036 INFO L87 Difference]: Start difference. First operand 441 states and 623 transitions. Second operand 13 states. [2018-02-02 20:09:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:43,499 INFO L93 Difference]: Finished difference Result 751 states and 986 transitions. [2018-02-02 20:09:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:09:43,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-02-02 20:09:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:43,501 INFO L225 Difference]: With dead ends: 751 [2018-02-02 20:09:43,501 INFO L226 Difference]: Without dead ends: 751 [2018-02-02 20:09:43,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:09:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-02-02 20:09:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 440. [2018-02-02 20:09:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 20:09:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 622 transitions. [2018-02-02 20:09:43,506 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 622 transitions. Word has length 34 [2018-02-02 20:09:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:43,506 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 622 transitions. [2018-02-02 20:09:43,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:09:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 622 transitions. [2018-02-02 20:09:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:09:43,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:43,507 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] [2018-02-02 20:09:43,507 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash -700463842, now seen corresponding path program 1 times [2018-02-02 20:09:43,508 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:43,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:43,712 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 20:09:43,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:43,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:43,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:43,713 INFO 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 20:09:43,713 INFO L182 omatonBuilderFactory]: Interpolants [17505#true, 17506#false, 17507#(= 1 (select |#valid| main_~tree~0.base)), 17508#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 17509#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 17510#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 17511#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17512#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17513#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17514#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 17515#(and (= |main_#t~mem13.offset| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 17516#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 17517#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 17518#(and (<= 0 |main_#t~mem10.offset|) (<= (+ |main_#t~mem10.offset| 4) (select |#length| |main_#t~mem10.base|)))] [2018-02-02 20:09:43,713 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 20:09:43,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:43,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:43,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:43,713 INFO L87 Difference]: Start difference. First operand 440 states and 622 transitions. Second operand 14 states. [2018-02-02 20:09:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:44,432 INFO L93 Difference]: Finished difference Result 750 states and 985 transitions. [2018-02-02 20:09:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:09:44,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 20:09:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:44,434 INFO L225 Difference]: With dead ends: 750 [2018-02-02 20:09:44,434 INFO L226 Difference]: Without dead ends: 750 [2018-02-02 20:09:44,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:09:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-02-02 20:09:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 435. [2018-02-02 20:09:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 20:09:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 617 transitions. [2018-02-02 20:09:44,438 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 617 transitions. Word has length 34 [2018-02-02 20:09:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:44,438 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 617 transitions. [2018-02-02 20:09:44,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 617 transitions. [2018-02-02 20:09:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:09:44,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:44,439 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 20:09:44,439 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204096, now seen corresponding path program 1 times [2018-02-02 20:09:44,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:44,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:44,563 INFO 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 20:09:44,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:44,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:09:44,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:44,564 INFO 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 20:09:44,564 INFO L182 omatonBuilderFactory]: Interpolants [18722#true, 18723#false, 18724#(= 0 |main_#t~malloc0.offset|), 18725#(= 0 main_~tree~0.offset), 18726#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 18727#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 18728#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 18729#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset)), 18730#(and (= 0 main_~tree~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 18731#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 18732#(= 1 (select |#valid| |main_#t~mem56.base|))] [2018-02-02 20:09:44,564 INFO 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 20:09:44,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:09:44,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:09:44,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:09:44,565 INFO L87 Difference]: Start difference. First operand 435 states and 617 transitions. Second operand 11 states. [2018-02-02 20:09:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:45,126 INFO L93 Difference]: Finished difference Result 670 states and 884 transitions. [2018-02-02 20:09:45,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:09:45,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 20:09:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:45,128 INFO L225 Difference]: With dead ends: 670 [2018-02-02 20:09:45,128 INFO L226 Difference]: Without dead ends: 670 [2018-02-02 20:09:45,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:09:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-02-02 20:09:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 445. [2018-02-02 20:09:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 20:09:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2018-02-02 20:09:45,133 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 35 [2018-02-02 20:09:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:45,133 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2018-02-02 20:09:45,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:09:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2018-02-02 20:09:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:09:45,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:45,134 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 20:09:45,134 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:45,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204095, now seen corresponding path program 1 times [2018-02-02 20:09:45,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:45,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:45,245 INFO 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 20:09:45,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:45,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:45,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:45,245 INFO 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 20:09:45,245 INFO L182 omatonBuilderFactory]: Interpolants [19878#true, 19879#false, 19880#(= 1 (select |#valid| main_~tree~0.base)), 19881#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 19882#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 19883#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem5.base|))), 19884#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 19885#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 19886#(and (= (select |#length| |main_#t~mem56.base|) 4) (= |main_#t~mem56.offset| 0))] [2018-02-02 20:09:45,245 INFO 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 20:09:45,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:45,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:45,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:45,246 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand 9 states. [2018-02-02 20:09:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:45,740 INFO L93 Difference]: Finished difference Result 855 states and 1135 transitions. [2018-02-02 20:09:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:45,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 20:09:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:45,742 INFO L225 Difference]: With dead ends: 855 [2018-02-02 20:09:45,742 INFO L226 Difference]: Without dead ends: 855 [2018-02-02 20:09:45,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-02-02 20:09:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 445. [2018-02-02 20:09:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 20:09:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 628 transitions. [2018-02-02 20:09:45,749 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 628 transitions. Word has length 35 [2018-02-02 20:09:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:45,749 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 628 transitions. [2018-02-02 20:09:45,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 628 transitions. [2018-02-02 20:09:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:09:45,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:45,750 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 20:09:45,750 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash 672897990, now seen corresponding path program 1 times [2018-02-02 20:09:45,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:45,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:45,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:45,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:45,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:45,777 INFO 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 20:09:45,777 INFO L182 omatonBuilderFactory]: Interpolants [21200#(= 1 (select |#valid| main_~newNode~0.base)), 21197#true, 21198#false, 21199#(= 1 (select |#valid| |main_#t~malloc25.base|))] [2018-02-02 20:09:45,777 INFO 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 20:09:45,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:45,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:45,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:45,778 INFO L87 Difference]: Start difference. First operand 445 states and 628 transitions. Second operand 4 states. [2018-02-02 20:09:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:45,970 INFO L93 Difference]: Finished difference Result 1124 states and 1602 transitions. [2018-02-02 20:09:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:45,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 20:09:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:45,972 INFO L225 Difference]: With dead ends: 1124 [2018-02-02 20:09:45,972 INFO L226 Difference]: Without dead ends: 1124 [2018-02-02 20:09:45,972 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 20:09:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-02-02 20:09:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 442. [2018-02-02 20:09:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 20:09:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-02-02 20:09:45,978 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 35 [2018-02-02 20:09:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:45,978 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-02-02 20:09:45,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-02-02 20:09:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:09:45,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:45,979 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 20:09:45,979 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:45,979 INFO L82 PathProgramCache]: Analyzing trace with hash 672897991, now seen corresponding path program 1 times [2018-02-02 20:09:45,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:45,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:46,021 INFO 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 20:09:46,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:46,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:46,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:46,021 INFO 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 20:09:46,022 INFO L182 omatonBuilderFactory]: Interpolants [22770#true, 22771#false, 22772#(and (= 0 |main_#t~malloc25.offset|) (= 12 (select |#length| |main_#t~malloc25.base|))), 22773#(and (= main_~newNode~0.offset 0) (= (select |#length| main_~newNode~0.base) 12))] [2018-02-02 20:09:46,022 INFO 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 20:09:46,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:46,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:46,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:46,022 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 4 states. [2018-02-02 20:09:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:46,142 INFO L93 Difference]: Finished difference Result 444 states and 627 transitions. [2018-02-02 20:09:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:46,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 20:09:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:46,144 INFO L225 Difference]: With dead ends: 444 [2018-02-02 20:09:46,144 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 20:09:46,144 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 20:09:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 20:09:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2018-02-02 20:09:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:09:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 626 transitions. [2018-02-02 20:09:46,147 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 626 transitions. Word has length 35 [2018-02-02 20:09:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:46,147 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 626 transitions. [2018-02-02 20:09:46,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 626 transitions. [2018-02-02 20:09:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:09:46,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:46,147 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] [2018-02-02 20:09:46,148 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1767576820, now seen corresponding path program 1 times [2018-02-02 20:09:46,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:46,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:46,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:46,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:09:46,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:46,197 INFO 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 20:09:46,198 INFO L182 omatonBuilderFactory]: Interpolants [23664#false, 23665#(and (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem47.offset|)), 23666#(or |main_#t~short49| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 23667#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 23668#(and (= |main_#t~mem50.base| 0) (= 0 |main_#t~mem50.offset|)), 23663#true] [2018-02-02 20:09:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:46,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:09:46,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:09:46,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:09:46,198 INFO L87 Difference]: Start difference. First operand 443 states and 626 transitions. Second operand 6 states. [2018-02-02 20:09:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:46,319 INFO L93 Difference]: Finished difference Result 541 states and 775 transitions. [2018-02-02 20:09:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:09:46,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 20:09:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:46,321 INFO L225 Difference]: With dead ends: 541 [2018-02-02 20:09:46,321 INFO L226 Difference]: Without dead ends: 541 [2018-02-02 20:09:46,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-02 20:09:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 452. [2018-02-02 20:09:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 20:09:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 638 transitions. [2018-02-02 20:09:46,326 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 638 transitions. Word has length 36 [2018-02-02 20:09:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:46,327 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 638 transitions. [2018-02-02 20:09:46,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:09:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 638 transitions. [2018-02-02 20:09:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:09:46,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:46,327 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] [2018-02-02 20:09:46,328 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1761851182, now seen corresponding path program 1 times [2018-02-02 20:09:46,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:46,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:46,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:46,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:09:46,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:46,509 INFO 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 20:09:46,509 INFO L182 omatonBuilderFactory]: Interpolants [24672#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 24673#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 24674#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 24675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 24676#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset)), 24677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 24678#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 24679#(and (= main_~tmp~0.offset 0) (= 0 |main_#t~mem48.base|) (= 0 |main_#t~mem48.offset|)), 24680#(and (= main_~tmp~0.offset 0) (not |main_#t~short49|)), 24668#true, 24669#false, 24670#(= 0 |main_#t~malloc0.offset|), 24671#(= 0 main_~tree~0.offset)] [2018-02-02 20:09:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:46,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:09:46,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:09:46,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:46,510 INFO L87 Difference]: Start difference. First operand 452 states and 638 transitions. Second operand 13 states. [2018-02-02 20:09:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:47,152 INFO L93 Difference]: Finished difference Result 574 states and 779 transitions. [2018-02-02 20:09:47,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:09:47,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 20:09:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:47,154 INFO L225 Difference]: With dead ends: 574 [2018-02-02 20:09:47,154 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 20:09:47,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:09:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 20:09:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 410. [2018-02-02 20:09:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 20:09:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 565 transitions. [2018-02-02 20:09:47,157 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 565 transitions. Word has length 36 [2018-02-02 20:09:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:47,157 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 565 transitions. [2018-02-02 20:09:47,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:09:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 565 transitions. [2018-02-02 20:09:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:09:47,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:47,157 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] [2018-02-02 20:09:47,157 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:47,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975311, now seen corresponding path program 1 times [2018-02-02 20:09:47,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:47,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:47,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 20:09:47,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:47,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:09:47,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:47,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 20:09:47,276 INFO L182 omatonBuilderFactory]: Interpolants [25696#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 25697#(= |main_#t~mem64.offset| 0), 25687#true, 25688#false, 25689#(= 0 |main_#t~malloc0.offset|), 25690#(= 0 main_~tree~0.offset), 25691#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 25692#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 25693#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 25694#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset)), 25695#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset))] [2018-02-02 20:09:47,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 20:09:47,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:09:47,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:09:47,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:09:47,276 INFO L87 Difference]: Start difference. First operand 410 states and 565 transitions. Second operand 11 states. [2018-02-02 20:09:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:47,652 INFO L93 Difference]: Finished difference Result 610 states and 784 transitions. [2018-02-02 20:09:47,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:09:47,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 20:09:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:47,653 INFO L225 Difference]: With dead ends: 610 [2018-02-02 20:09:47,653 INFO L226 Difference]: Without dead ends: 610 [2018-02-02 20:09:47,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:09:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-02-02 20:09:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 413. [2018-02-02 20:09:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 20:09:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-02-02 20:09:47,656 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 38 [2018-02-02 20:09:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:47,656 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-02-02 20:09:47,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:09:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-02-02 20:09:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:09:47,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:47,657 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] [2018-02-02 20:09:47,657 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975312, now seen corresponding path program 1 times [2018-02-02 20:09:47,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:47,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:47,684 INFO 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 20:09:47,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:47,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:47,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:47,685 INFO 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 20:09:47,685 INFO L182 omatonBuilderFactory]: Interpolants [26745#true, 26746#false, 26747#(= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 26748#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 26749#(= 1 (select |#valid| |main_#t~mem64.base|))] [2018-02-02 20:09:47,685 INFO 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 20:09:47,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:47,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:47,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:47,686 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 5 states. [2018-02-02 20:09:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:47,868 INFO L93 Difference]: Finished difference Result 412 states and 565 transitions. [2018-02-02 20:09:47,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:47,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 20:09:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:47,870 INFO L225 Difference]: With dead ends: 412 [2018-02-02 20:09:47,870 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 20:09:47,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:09:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 20:09:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2018-02-02 20:09:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 20:09:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 565 transitions. [2018-02-02 20:09:47,874 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 565 transitions. Word has length 38 [2018-02-02 20:09:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:47,874 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 565 transitions. [2018-02-02 20:09:47,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 565 transitions. [2018-02-02 20:09:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:09:47,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:47,875 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] [2018-02-02 20:09:47,875 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:47,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976497, now seen corresponding path program 1 times [2018-02-02 20:09:47,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:47,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:47,898 INFO 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 20:09:47,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:47,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:47,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:47,899 INFO 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 20:09:47,899 INFO L182 omatonBuilderFactory]: Interpolants [27578#true, 27579#false, 27580#(= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 27581#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 27582#(= 1 (select |#valid| |main_#t~mem59.base|))] [2018-02-02 20:09:47,899 INFO 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 20:09:47,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:47,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:47,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:47,900 INFO L87 Difference]: Start difference. First operand 412 states and 565 transitions. Second operand 5 states. [2018-02-02 20:09:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:48,054 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2018-02-02 20:09:48,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:48,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 20:09:48,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:48,055 INFO L225 Difference]: With dead ends: 411 [2018-02-02 20:09:48,055 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 20:09:48,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:09:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 20:09:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-02 20:09:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 20:09:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 561 transitions. [2018-02-02 20:09:48,058 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 561 transitions. Word has length 38 [2018-02-02 20:09:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:48,058 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 561 transitions. [2018-02-02 20:09:48,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 561 transitions. [2018-02-02 20:09:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:09:48,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:48,058 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] [2018-02-02 20:09:48,058 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976498, now seen corresponding path program 1 times [2018-02-02 20:09:48,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:48,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:48,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:48,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,096 INFO L182 omatonBuilderFactory]: Interpolants [28409#true, 28410#false, 28411#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 28412#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 28413#(and (<= (+ |main_#t~mem59.offset| 4) (select |#length| |main_#t~mem59.base|)) (<= 0 |main_#t~mem59.offset|))] [2018-02-02 20:09:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:48,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:48,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:48,097 INFO L87 Difference]: Start difference. First operand 411 states and 561 transitions. Second operand 5 states. [2018-02-02 20:09:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:48,273 INFO L93 Difference]: Finished difference Result 410 states and 557 transitions. [2018-02-02 20:09:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:48,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 20:09:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:48,274 INFO L225 Difference]: With dead ends: 410 [2018-02-02 20:09:48,274 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 20:09:48,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:09:48,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 20:09:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-02-02 20:09:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 20:09:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 557 transitions. [2018-02-02 20:09:48,277 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 557 transitions. Word has length 38 [2018-02-02 20:09:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:48,277 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 557 transitions. [2018-02-02 20:09:48,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 557 transitions. [2018-02-02 20:09:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:09:48,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:48,278 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] [2018-02-02 20:09:48,278 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1691774874, now seen corresponding path program 1 times [2018-02-02 20:09:48,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:48,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:48,321 INFO 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 20:09:48,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:48,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:09:48,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,322 INFO L182 omatonBuilderFactory]: Interpolants [29238#true, 29239#false, 29240#(and (= 0 |main_#t~malloc25.offset|) (= 12 (select |#length| |main_#t~malloc25.base|))), 29241#(and (= main_~newNode~0.offset 0) (= (select |#length| main_~newNode~0.base) 12)), 29242#(and (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#length| main_~newNode~0.base) 12)), 29243#(and (<= 12 (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0))] [2018-02-02 20:09:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:09:48,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:09:48,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:09:48,322 INFO L87 Difference]: Start difference. First operand 410 states and 557 transitions. Second operand 6 states. [2018-02-02 20:09:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:48,563 INFO L93 Difference]: Finished difference Result 852 states and 1192 transitions. [2018-02-02 20:09:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:09:48,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 20:09:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:48,565 INFO L225 Difference]: With dead ends: 852 [2018-02-02 20:09:48,565 INFO L226 Difference]: Without dead ends: 852 [2018-02-02 20:09:48,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-02-02 20:09:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 414. [2018-02-02 20:09:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-02 20:09:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2018-02-02 20:09:48,568 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 561 transitions. Word has length 38 [2018-02-02 20:09:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:48,568 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 561 transitions. [2018-02-02 20:09:48,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:09:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 561 transitions. [2018-02-02 20:09:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:09:48,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:48,569 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] [2018-02-02 20:09:48,569 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash 156771650, now seen corresponding path program 1 times [2018-02-02 20:09:48,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:48,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:48,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:48,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,603 INFO L182 omatonBuilderFactory]: Interpolants [30514#true, 30515#false, 30516#(= 1 (select |#valid| |main_#t~malloc30.base|)), 30517#(= 1 (select |#valid| main_~newNode~0.base))] [2018-02-02 20:09:48,604 INFO 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 20:09:48,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:48,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:48,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:48,604 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. Second operand 4 states. [2018-02-02 20:09:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:48,776 INFO L93 Difference]: Finished difference Result 1097 states and 1518 transitions. [2018-02-02 20:09:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:48,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-02 20:09:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:48,778 INFO L225 Difference]: With dead ends: 1097 [2018-02-02 20:09:48,779 INFO L226 Difference]: Without dead ends: 1097 [2018-02-02 20:09:48,779 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 20:09:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-02-02 20:09:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 413. [2018-02-02 20:09:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 20:09:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 560 transitions. [2018-02-02 20:09:48,783 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 560 transitions. Word has length 39 [2018-02-02 20:09:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:48,783 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 560 transitions. [2018-02-02 20:09:48,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 560 transitions. [2018-02-02 20:09:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:09:48,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:48,783 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] [2018-02-02 20:09:48,783 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash 156771651, now seen corresponding path program 1 times [2018-02-02 20:09:48,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:48,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:48,817 INFO 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 20:09:48,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:48,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:48,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,818 INFO L182 omatonBuilderFactory]: Interpolants [32032#false, 32033#(and (= 0 |main_#t~malloc30.offset|) (= 12 (select |#length| |main_#t~malloc30.base|))), 32034#(and (= main_~newNode~0.offset 0) (= (select |#length| main_~newNode~0.base) 12)), 32031#true] [2018-02-02 20:09:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:48,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:48,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:48,818 INFO L87 Difference]: Start difference. First operand 413 states and 560 transitions. Second operand 4 states. [2018-02-02 20:09:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:48,901 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2018-02-02 20:09:48,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:48,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-02 20:09:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:48,902 INFO L225 Difference]: With dead ends: 411 [2018-02-02 20:09:48,902 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 20:09:48,902 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 20:09:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 20:09:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-02 20:09:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 20:09:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 558 transitions. [2018-02-02 20:09:48,905 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 558 transitions. Word has length 39 [2018-02-02 20:09:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:48,905 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 558 transitions. [2018-02-02 20:09:48,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 558 transitions. [2018-02-02 20:09:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:09:48,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:48,905 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] [2018-02-02 20:09:48,905 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash 106473297, now seen corresponding path program 1 times [2018-02-02 20:09:48,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:48,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:49,044 INFO 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 20:09:49,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:49,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 20:09:49,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:49,066 INFO 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 20:09:49,066 INFO L182 omatonBuilderFactory]: Interpolants [32864#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= 0 main_~tmp~0.base))), 32865#(and (= 1 (select |#valid| main_~tmp~0.base)) (not (= 0 main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) |main_#t~mem47.base|)), 32866#(and (or |main_#t~short49| (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base))) (= 1 (select |#valid| main_~tmp~0.base))), 32867#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base))), 32868#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 32869#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 32870#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= |main_#t~mem58.base| main_~tmp~0.base)) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select |#memory_$Pointer$.base| main_~tmp~0.base)))) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 32871#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 32872#(and (or (not (= 0 |main_#t~mem64.offset|)) (= 1 (select (store |#valid| |main_#t~mem64.base| 0) main_~tmp~0.base))) (= 1 (select |#valid| main_~tmp~0.base))), 32873#(= 1 (select |#valid| main_~tmp~0.base)), 32859#true, 32860#false, 32861#(and (not (= 0 |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 32862#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base))), 32863#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-02 20:09:49,066 INFO 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 20:09:49,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:09:49,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:09:49,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:09:49,067 INFO L87 Difference]: Start difference. First operand 411 states and 558 transitions. Second operand 15 states. [2018-02-02 20:09:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:49,896 INFO L93 Difference]: Finished difference Result 722 states and 905 transitions. [2018-02-02 20:09:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:09:49,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-02 20:09:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:49,898 INFO L225 Difference]: With dead ends: 722 [2018-02-02 20:09:49,898 INFO L226 Difference]: Without dead ends: 722 [2018-02-02 20:09:49,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:09:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-02 20:09:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 438. [2018-02-02 20:09:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 20:09:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 600 transitions. [2018-02-02 20:09:49,901 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 600 transitions. Word has length 40 [2018-02-02 20:09:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:49,901 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 600 transitions. [2018-02-02 20:09:49,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:09:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 600 transitions. [2018-02-02 20:09:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:09:49,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:49,902 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] [2018-02-02 20:09:49,902 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash -958985529, now seen corresponding path program 1 times [2018-02-02 20:09:49,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:49,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:50,059 INFO 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 20:09:50,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:50,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 20:09:50,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:50,059 INFO 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 20:09:50,059 INFO L182 omatonBuilderFactory]: Interpolants [34082#true, 34083#false, 34084#(= 1 (select |#valid| main_~tree~0.base)), 34085#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 34086#(not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34087#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34088#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 34089#(= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34090#(= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34091#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 34092#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34093#(and (= 1 (select |#valid| |main_#t~mem57.base|)) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 34094#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 34095#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|))), 34096#(= 1 (select |#valid| |main_#t~mem60.base|)), 34097#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-02 20:09:50,059 INFO 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 20:09:50,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:09:50,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:09:50,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:09:50,060 INFO L87 Difference]: Start difference. First operand 438 states and 600 transitions. Second operand 16 states. [2018-02-02 20:09:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:50,667 INFO L93 Difference]: Finished difference Result 755 states and 959 transitions. [2018-02-02 20:09:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:09:50,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 20:09:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:50,669 INFO L225 Difference]: With dead ends: 755 [2018-02-02 20:09:50,669 INFO L226 Difference]: Without dead ends: 755 [2018-02-02 20:09:50,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:09:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-02-02 20:09:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 443. [2018-02-02 20:09:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:09:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2018-02-02 20:09:50,672 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 41 [2018-02-02 20:09:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:50,672 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2018-02-02 20:09:50,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:09:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2018-02-02 20:09:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:09:50,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:50,673 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] [2018-02-02 20:09:50,673 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash -958985528, now seen corresponding path program 1 times [2018-02-02 20:09:50,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:50,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:50,780 INFO 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 20:09:50,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:50,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:09:50,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:50,780 INFO 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 20:09:50,780 INFO L182 omatonBuilderFactory]: Interpolants [35328#(not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 35329#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 35330#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.offset|) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 35331#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 35332#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 35333#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 35334#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 35335#(and (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 35324#true, 35325#false, 35326#(= 1 (select |#valid| main_~tree~0.base)), 35327#(not (= main_~tree~0.base |main_#t~malloc3.base|))] [2018-02-02 20:09:50,780 INFO 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 20:09:50,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:09:50,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:09:50,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:09:50,781 INFO L87 Difference]: Start difference. First operand 443 states and 606 transitions. Second operand 12 states. [2018-02-02 20:09:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:51,235 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2018-02-02 20:09:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:09:51,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 20:09:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:51,237 INFO L225 Difference]: With dead ends: 593 [2018-02-02 20:09:51,237 INFO L226 Difference]: Without dead ends: 593 [2018-02-02 20:09:51,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:09:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-02 20:09:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 438. [2018-02-02 20:09:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 20:09:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 599 transitions. [2018-02-02 20:09:51,240 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 599 transitions. Word has length 41 [2018-02-02 20:09:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:51,240 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 599 transitions. [2018-02-02 20:09:51,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:09:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 599 transitions. [2018-02-02 20:09:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:09:51,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:51,241 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] [2018-02-02 20:09:51,241 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1775844849, now seen corresponding path program 1 times [2018-02-02 20:09:51,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:51,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:51,283 INFO 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 20:09:51,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:51,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:51,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:51,283 INFO 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 20:09:51,283 INFO L182 omatonBuilderFactory]: Interpolants [36385#true, 36386#false, 36387#(= 1 (select |#valid| |main_#t~malloc35.base|)), 36388#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 36389#(= 1 (select |#valid| |main_#t~mem37.base|))] [2018-02-02 20:09:51,283 INFO 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 20:09:51,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:51,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:51,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:51,284 INFO L87 Difference]: Start difference. First operand 438 states and 599 transitions. Second operand 5 states. [2018-02-02 20:09:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:51,427 INFO L93 Difference]: Finished difference Result 653 states and 894 transitions. [2018-02-02 20:09:51,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:51,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 20:09:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:51,428 INFO L225 Difference]: With dead ends: 653 [2018-02-02 20:09:51,428 INFO L226 Difference]: Without dead ends: 653 [2018-02-02 20:09:51,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-02-02 20:09:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 437. [2018-02-02 20:09:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-02 20:09:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 598 transitions. [2018-02-02 20:09:51,431 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 598 transitions. Word has length 41 [2018-02-02 20:09:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:51,432 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 598 transitions. [2018-02-02 20:09:51,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 598 transitions. [2018-02-02 20:09:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:09:51,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:51,432 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] [2018-02-02 20:09:51,432 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1775844848, now seen corresponding path program 1 times [2018-02-02 20:09:51,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:51,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:51,480 INFO 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 20:09:51,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:51,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:51,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:51,480 INFO 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 20:09:51,480 INFO L182 omatonBuilderFactory]: Interpolants [37488#(and (= 0 |main_#t~malloc35.offset|) (= 4 (select |#length| |main_#t~malloc35.base|))), 37489#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 37490#(and (= (select |#length| |main_#t~mem37.base|) 4) (= |main_#t~mem37.offset| 0)), 37486#true, 37487#false] [2018-02-02 20:09:51,480 INFO 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 20:09:51,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:51,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:51,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:51,481 INFO L87 Difference]: Start difference. First operand 437 states and 598 transitions. Second operand 5 states. [2018-02-02 20:09:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:51,667 INFO L93 Difference]: Finished difference Result 668 states and 914 transitions. [2018-02-02 20:09:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:51,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 20:09:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:51,668 INFO L225 Difference]: With dead ends: 668 [2018-02-02 20:09:51,668 INFO L226 Difference]: Without dead ends: 668 [2018-02-02 20:09:51,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-02 20:09:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 436. [2018-02-02 20:09:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 20:09:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 597 transitions. [2018-02-02 20:09:51,671 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 597 transitions. Word has length 41 [2018-02-02 20:09:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:51,671 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 597 transitions. [2018-02-02 20:09:51,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 597 transitions. [2018-02-02 20:09:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:09:51,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:51,672 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] [2018-02-02 20:09:51,672 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1754899614, now seen corresponding path program 1 times [2018-02-02 20:09:51,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:51,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:51,718 INFO 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 20:09:51,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:51,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:51,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:51,719 INFO L182 omatonBuilderFactory]: Interpolants [38601#true, 38602#false, 38603#(and (= 0 |main_#t~malloc30.offset|) (= 12 (select |#length| |main_#t~malloc30.base|))), 38604#(and (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base))), 38605#(and (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)))] [2018-02-02 20:09:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:51,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:51,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:51,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:51,720 INFO L87 Difference]: Start difference. First operand 436 states and 597 transitions. Second operand 5 states. [2018-02-02 20:09:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:51,932 INFO L93 Difference]: Finished difference Result 877 states and 1237 transitions. [2018-02-02 20:09:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:09:51,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-02 20:09:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:51,934 INFO L225 Difference]: With dead ends: 877 [2018-02-02 20:09:51,934 INFO L226 Difference]: Without dead ends: 877 [2018-02-02 20:09:51,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 20:09:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-02-02 20:09:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 427. [2018-02-02 20:09:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 20:09:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2018-02-02 20:09:51,939 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 42 [2018-02-02 20:09:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:51,939 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2018-02-02 20:09:51,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2018-02-02 20:09:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:09:51,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:51,940 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] [2018-02-02 20:09:51,940 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1349100373, now seen corresponding path program 1 times [2018-02-02 20:09:51,940 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:51,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:52,310 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 20:09:52,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:52,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:09:52,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:52,311 INFO 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 20:09:52,311 INFO L182 omatonBuilderFactory]: Interpolants [39914#true, 39915#false, 39916#(= 0 (select |#valid| 0)), 39917#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 39918#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 39919#(and (not (= 0 main_~tree~0.base)) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 39920#(and (= 1 (select |#valid| main_~tree~0.base)) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 39921#(and (= |old(#valid)| (store (store |#valid| main_~tree~0.base 0) |main_#t~malloc3.base| 0)) (not (= 0 main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 39922#(and (not (= 0 main_~tree~0.base)) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 39923#(and (not (= 0 main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 39924#(and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| 0)) (not (= 0 main_~tmp~0.base))), 39925#(and (or (and (not (= 0 |main_#t~mem56.base|)) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| |main_#t~mem56.base|))) (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base))), 39926#(and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base))), 39927#(and (= (store (store |#valid| main_~tmp~0.base 0) |main_#t~mem64.base| (select (store |#valid| |main_#t~mem64.base| 0) |main_#t~mem64.base|)) |old(#valid)|) (not (= 0 |main_#t~mem64.base|)) (not (= 0 main_~tmp~0.base)) (not (= |main_#t~mem64.base| main_~tmp~0.base))), 39928#(and (= (store |#valid| main_~tmp~0.base 0) |old(#valid)|) (not (= 0 main_~tmp~0.base))), 39929#(= |#valid| |old(#valid)|)] [2018-02-02 20:09:52,311 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 20:09:52,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:09:52,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:09:52,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:09:52,311 INFO L87 Difference]: Start difference. First operand 427 states and 588 transitions. Second operand 16 states. [2018-02-02 20:09:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:53,385 INFO L93 Difference]: Finished difference Result 509 states and 683 transitions. [2018-02-02 20:09:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:09:53,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-02 20:09:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:53,387 INFO L225 Difference]: With dead ends: 509 [2018-02-02 20:09:53,387 INFO L226 Difference]: Without dead ends: 507 [2018-02-02 20:09:53,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:09:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-02 20:09:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 431. [2018-02-02 20:09:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-02 20:09:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2018-02-02 20:09:53,391 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 44 [2018-02-02 20:09:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:53,391 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2018-02-02 20:09:53,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:09:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2018-02-02 20:09:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:09:53,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:53,392 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] [2018-02-02 20:09:53,392 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1349098584, now seen corresponding path program 1 times [2018-02-02 20:09:53,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:53,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:53,406 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 20:09:53,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:53,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:53,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:53,407 INFO L182 omatonBuilderFactory]: Interpolants [40896#(and (= main_~tree~0.base 0) (= main_~tree~0.offset 0)), 40894#true, 40895#false] [2018-02-02 20:09:53,407 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 20:09:53,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:09:53,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:09:53,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:53,407 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand 3 states. [2018-02-02 20:09:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:53,417 INFO L93 Difference]: Finished difference Result 419 states and 539 transitions. [2018-02-02 20:09:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:09:53,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-02-02 20:09:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:53,419 INFO L225 Difference]: With dead ends: 419 [2018-02-02 20:09:53,420 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:09:53,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:09:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 382. [2018-02-02 20:09:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 20:09:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 518 transitions. [2018-02-02 20:09:53,423 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 518 transitions. Word has length 44 [2018-02-02 20:09:53,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:53,423 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 518 transitions. [2018-02-02 20:09:53,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:09:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 518 transitions. [2018-02-02 20:09:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:09:53,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:53,424 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] [2018-02-02 20:09:53,424 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1114352130, now seen corresponding path program 1 times [2018-02-02 20:09:53,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:53,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:53,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:53,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:53,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:53,588 INFO L182 omatonBuilderFactory]: Interpolants [41698#true, 41699#false, 41700#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 41701#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset))), 41702#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 41703#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 41704#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 41705#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 41706#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|))), 41707#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 41708#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 41709#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 41710#(not |main_#t~short18|)] [2018-02-02 20:09:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:53,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:09:53,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:09:53,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:53,589 INFO L87 Difference]: Start difference. First operand 382 states and 518 transitions. Second operand 13 states. [2018-02-02 20:09:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:54,494 INFO L93 Difference]: Finished difference Result 619 states and 785 transitions. [2018-02-02 20:09:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:09:54,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-02 20:09:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:54,495 INFO L225 Difference]: With dead ends: 619 [2018-02-02 20:09:54,495 INFO L226 Difference]: Without dead ends: 619 [2018-02-02 20:09:54,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:09:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-02 20:09:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 399. [2018-02-02 20:09:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 20:09:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 540 transitions. [2018-02-02 20:09:54,499 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 540 transitions. Word has length 45 [2018-02-02 20:09:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:54,499 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 540 transitions. [2018-02-02 20:09:54,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:09:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 540 transitions. [2018-02-02 20:09:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:09:54,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:54,500 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] [2018-02-02 20:09:54,500 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:54,500 INFO L82 PathProgramCache]: Analyzing trace with hash 550494502, now seen corresponding path program 1 times [2018-02-02 20:09:54,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:54,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:54,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:54,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:54,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:54,752 INFO 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 20:09:54,752 INFO L182 omatonBuilderFactory]: Interpolants [42755#true, 42756#false, 42757#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 42758#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset))), 42759#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 42760#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 42761#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 42762#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 42763#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|))), 42764#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 42765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 42766#(and (= |main_#t~mem47.base| 0) (= 0 |main_#t~mem47.offset|)), 42767#(not |main_#t~short49|)] [2018-02-02 20:09:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:54,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:09:54,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:09:54,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:54,752 INFO L87 Difference]: Start difference. First operand 399 states and 540 transitions. Second operand 13 states. [2018-02-02 20:09:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:55,477 INFO L93 Difference]: Finished difference Result 609 states and 771 transitions. [2018-02-02 20:09:55,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:09:55,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-02-02 20:09:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:55,478 INFO L225 Difference]: With dead ends: 609 [2018-02-02 20:09:55,478 INFO L226 Difference]: Without dead ends: 609 [2018-02-02 20:09:55,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:09:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-02 20:09:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 450. [2018-02-02 20:09:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-02 20:09:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 621 transitions. [2018-02-02 20:09:55,482 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 621 transitions. Word has length 46 [2018-02-02 20:09:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:55,483 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 621 transitions. [2018-02-02 20:09:55,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:09:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 621 transitions. [2018-02-02 20:09:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:09:55,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:55,483 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] [2018-02-02 20:09:55,483 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash -54941909, now seen corresponding path program 1 times [2018-02-02 20:09:55,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:55,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:55,601 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 20:09:55,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:55,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:55,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:55,602 INFO 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 20:09:55,602 INFO L182 omatonBuilderFactory]: Interpolants [43857#true, 43858#false, 43859#(= 1 (select |#valid| main_~tree~0.base)), 43860#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 43861#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 43862#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 43863#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43864#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43865#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43866#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43867#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43868#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 43869#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 43870#(= 1 (select |#valid| |main_#t~mem56.base|))] [2018-02-02 20:09:55,602 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 20:09:55,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:55,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:55,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:55,603 INFO L87 Difference]: Start difference. First operand 450 states and 621 transitions. Second operand 14 states. [2018-02-02 20:09:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:56,114 INFO L93 Difference]: Finished difference Result 655 states and 865 transitions. [2018-02-02 20:09:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:09:56,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 20:09:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:56,116 INFO L225 Difference]: With dead ends: 655 [2018-02-02 20:09:56,116 INFO L226 Difference]: Without dead ends: 655 [2018-02-02 20:09:56,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:09:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-02-02 20:09:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 455. [2018-02-02 20:09:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-02 20:09:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 627 transitions. [2018-02-02 20:09:56,121 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 627 transitions. Word has length 47 [2018-02-02 20:09:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:56,121 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 627 transitions. [2018-02-02 20:09:56,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 627 transitions. [2018-02-02 20:09:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:09:56,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:56,122 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] [2018-02-02 20:09:56,122 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -54941908, now seen corresponding path program 1 times [2018-02-02 20:09:56,123 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:56,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:56,409 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 20:09:56,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:56,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:56,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:56,410 INFO 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 20:09:56,410 INFO L182 omatonBuilderFactory]: Interpolants [45024#(and (= (select |#length| |main_#t~mem56.base|) 4) (= |main_#t~mem56.offset| 0)), 45011#true, 45012#false, 45013#(= 1 (select |#valid| main_~tree~0.base)), 45014#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 45015#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 45016#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 45017#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 45018#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45019#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45020#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| |main_#t~mem10.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45021#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 45022#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45023#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))] [2018-02-02 20:09:56,410 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 20:09:56,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:56,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:56,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:56,411 INFO L87 Difference]: Start difference. First operand 455 states and 627 transitions. Second operand 14 states. [2018-02-02 20:09:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:57,208 INFO L93 Difference]: Finished difference Result 750 states and 981 transitions. [2018-02-02 20:09:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:09:57,208 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 20:09:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:57,209 INFO L225 Difference]: With dead ends: 750 [2018-02-02 20:09:57,210 INFO L226 Difference]: Without dead ends: 750 [2018-02-02 20:09:57,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:09:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-02-02 20:09:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 455. [2018-02-02 20:09:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-02 20:09:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 626 transitions. [2018-02-02 20:09:57,214 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 626 transitions. Word has length 47 [2018-02-02 20:09:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:57,214 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 626 transitions. [2018-02-02 20:09:57,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 626 transitions. [2018-02-02 20:09:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:09:57,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:57,214 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] [2018-02-02 20:09:57,214 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1075298233, now seen corresponding path program 1 times [2018-02-02 20:09:57,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:57,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:57,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:57,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:09:57,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:57,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 20:09:57,415 INFO L182 omatonBuilderFactory]: Interpolants [46256#true, 46257#false, 46258#(= 1 (select |#valid| main_~tree~0.base)), 46259#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 46260#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4)))), 46261#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 46262#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 46263#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 46264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 46265#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 4)))), 46266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 46267#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 46268#(and (= 0 |main_#t~mem48.base|) (= 0 |main_#t~mem48.offset|)), 46269#(not |main_#t~short49|)] [2018-02-02 20:09:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:57,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:57,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:57,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:57,416 INFO L87 Difference]: Start difference. First operand 455 states and 626 transitions. Second operand 14 states. [2018-02-02 20:09:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:58,075 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2018-02-02 20:09:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:09:58,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-02-02 20:09:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:58,077 INFO L225 Difference]: With dead ends: 562 [2018-02-02 20:09:58,077 INFO L226 Difference]: Without dead ends: 562 [2018-02-02 20:09:58,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:09:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-02 20:09:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 413. [2018-02-02 20:09:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 20:09:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 554 transitions. [2018-02-02 20:09:58,079 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 554 transitions. Word has length 48 [2018-02-02 20:09:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:58,080 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 554 transitions. [2018-02-02 20:09:58,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 554 transitions. [2018-02-02 20:09:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:09:58,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:58,080 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] [2018-02-02 20:09:58,080 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1807586396, now seen corresponding path program 1 times [2018-02-02 20:09:58,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:58,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:58,401 INFO 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 20:09:58,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:58,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:09:58,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:58,402 INFO L182 omatonBuilderFactory]: Interpolants [47269#true, 47270#false, 47271#(= 0 |main_#t~malloc0.offset|), 47272#(= 0 main_~tree~0.offset), 47273#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 47274#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 47275#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47276#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47277#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47278#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 47279#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 47280#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 47281#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 47282#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 47283#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 47284#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 47285#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47286#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 47287#(= 1 (select |#valid| |main_#t~mem42.base|))] [2018-02-02 20:09:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:58,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:09:58,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:09:58,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:09:58,403 INFO L87 Difference]: Start difference. First operand 413 states and 554 transitions. Second operand 19 states. [2018-02-02 20:09:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:59,727 INFO L93 Difference]: Finished difference Result 844 states and 1081 transitions. [2018-02-02 20:09:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:09:59,727 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 20:09:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:59,728 INFO L225 Difference]: With dead ends: 844 [2018-02-02 20:09:59,728 INFO L226 Difference]: Without dead ends: 844 [2018-02-02 20:09:59,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:09:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-02-02 20:09:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 472. [2018-02-02 20:09:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-02 20:09:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 638 transitions. [2018-02-02 20:09:59,732 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 638 transitions. Word has length 49 [2018-02-02 20:09:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:59,732 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 638 transitions. [2018-02-02 20:09:59,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:09:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 638 transitions. [2018-02-02 20:09:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:09:59,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:59,733 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] [2018-02-02 20:09:59,733 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:09:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1807586397, now seen corresponding path program 1 times [2018-02-02 20:09:59,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:59,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:00,169 INFO 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 20:10:00,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:00,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:10:00,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:00,169 INFO 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 20:10:00,170 INFO L182 omatonBuilderFactory]: Interpolants [48640#true, 48641#false, 48642#(= 0 |main_#t~malloc0.offset|), 48643#(= 0 main_~tree~0.offset), 48644#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 48645#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= (select |#valid| |main_#t~malloc3.base|) 1) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset) (= 4 (select |#length| |main_#t~malloc3.base|))), 48646#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 48647#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 48648#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 48649#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 48650#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 48651#(and (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 48652#(and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~newNode~0.base main_~tree~0.base)) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 48653#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 48654#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 48655#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 48656#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 48657#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 48658#(and (= (select |#length| |main_#t~mem42.base|) 4) (= |main_#t~mem42.offset| 0))] [2018-02-02 20:10:00,170 INFO 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 20:10:00,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:10:00,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:10:00,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:10:00,170 INFO L87 Difference]: Start difference. First operand 472 states and 638 transitions. Second operand 19 states. [2018-02-02 20:10:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:01,733 INFO L93 Difference]: Finished difference Result 841 states and 1078 transitions. [2018-02-02 20:10:01,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:10:01,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 20:10:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:01,734 INFO L225 Difference]: With dead ends: 841 [2018-02-02 20:10:01,734 INFO L226 Difference]: Without dead ends: 841 [2018-02-02 20:10:01,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:10:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-02-02 20:10:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 472. [2018-02-02 20:10:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-02 20:10:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 637 transitions. [2018-02-02 20:10:01,737 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 637 transitions. Word has length 49 [2018-02-02 20:10:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:01,738 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 637 transitions. [2018-02-02 20:10:01,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:10:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 637 transitions. [2018-02-02 20:10:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:10:01,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:01,738 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] [2018-02-02 20:10:01,738 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:01,738 INFO L82 PathProgramCache]: Analyzing trace with hash 26954866, now seen corresponding path program 1 times [2018-02-02 20:10:01,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:01,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:01,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:01,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:10:01,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:01,791 INFO 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 20:10:01,791 INFO L182 omatonBuilderFactory]: Interpolants [50002#true, 50003#false, 50004#(= 0 |main_#t~malloc0.offset|), 50005#(= 0 main_~tree~0.offset), 50006#(and (= main_~tmp~0.offset 0) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base)), 50007#(and (<= 4 (select |#length| main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 50008#(and (<= 4 (select |#length| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 50009#(and (= main_~tmp~0.offset 0) (<= 4 (select |#length| main_~tmp~0.base)))] [2018-02-02 20:10:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:01,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:10:01,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:10:01,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:01,792 INFO L87 Difference]: Start difference. First operand 472 states and 637 transitions. Second operand 8 states. [2018-02-02 20:10:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:02,227 INFO L93 Difference]: Finished difference Result 668 states and 842 transitions. [2018-02-02 20:10:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:10:02,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-02 20:10:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:02,229 INFO L225 Difference]: With dead ends: 668 [2018-02-02 20:10:02,229 INFO L226 Difference]: Without dead ends: 668 [2018-02-02 20:10:02,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:10:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-02 20:10:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 505. [2018-02-02 20:10:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-02 20:10:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 687 transitions. [2018-02-02 20:10:02,233 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 687 transitions. Word has length 50 [2018-02-02 20:10:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:02,233 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 687 transitions. [2018-02-02 20:10:02,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:10:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 687 transitions. [2018-02-02 20:10:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:10:02,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:02,234 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] [2018-02-02 20:10:02,234 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 200603590, now seen corresponding path program 1 times [2018-02-02 20:10:02,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:02,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:02,259 INFO 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 20:10:02,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:02,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:02,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:02,259 INFO 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 20:10:02,259 INFO L182 omatonBuilderFactory]: Interpolants [51195#true, 51196#false, 51197#(= 1 (select |#valid| |main_#t~malloc41.base|)), 51198#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-02 20:10:02,260 INFO 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 20:10:02,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:02,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:02,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:02,260 INFO L87 Difference]: Start difference. First operand 505 states and 687 transitions. Second operand 4 states. [2018-02-02 20:10:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:02,430 INFO L93 Difference]: Finished difference Result 900 states and 1217 transitions. [2018-02-02 20:10:02,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:02,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-02-02 20:10:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:02,432 INFO L225 Difference]: With dead ends: 900 [2018-02-02 20:10:02,432 INFO L226 Difference]: Without dead ends: 900 [2018-02-02 20:10:02,432 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 20:10:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-02-02 20:10:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 504. [2018-02-02 20:10:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-02 20:10:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 686 transitions. [2018-02-02 20:10:02,436 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 686 transitions. Word has length 50 [2018-02-02 20:10:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:02,436 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 686 transitions. [2018-02-02 20:10:02,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2018-02-02 20:10:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:10:02,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:02,437 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] [2018-02-02 20:10:02,437 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 200603591, now seen corresponding path program 1 times [2018-02-02 20:10:02,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:02,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:02,463 INFO 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 20:10:02,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:02,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:02,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:02,464 INFO 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 20:10:02,464 INFO L182 omatonBuilderFactory]: Interpolants [52608#(and (= 0 |main_#t~malloc41.offset|) (= 4 (select |#length| |main_#t~malloc41.base|))), 52609#(and (= (select |#length| main_~tmpList~0.base) 4) (= main_~tmpList~0.offset 0)), 52606#true, 52607#false] [2018-02-02 20:10:02,464 INFO 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 20:10:02,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:02,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:02,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:02,464 INFO L87 Difference]: Start difference. First operand 504 states and 686 transitions. Second operand 4 states. [2018-02-02 20:10:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:02,654 INFO L93 Difference]: Finished difference Result 690 states and 892 transitions. [2018-02-02 20:10:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:02,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-02-02 20:10:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:02,656 INFO L225 Difference]: With dead ends: 690 [2018-02-02 20:10:02,656 INFO L226 Difference]: Without dead ends: 690 [2018-02-02 20:10:02,656 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 20:10:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-02 20:10:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 503. [2018-02-02 20:10:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 20:10:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 685 transitions. [2018-02-02 20:10:02,662 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 685 transitions. Word has length 50 [2018-02-02 20:10:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:02,662 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 685 transitions. [2018-02-02 20:10:02,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 685 transitions. [2018-02-02 20:10:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:10:02,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:02,663 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] [2018-02-02 20:10:02,663 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -391604284, now seen corresponding path program 1 times [2018-02-02 20:10:02,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:02,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:02,769 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 20:10:02,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:02,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:10:02,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:02,769 INFO 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 20:10:02,769 INFO L182 omatonBuilderFactory]: Interpolants [53808#(= 1 (select |#valid| main_~tree~0.base)), 53809#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 53810#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 53811#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 53812#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 53813#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 53814#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 53815#(= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))), 53816#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 53817#(= |main_#t~mem64.offset| 0), 53806#true, 53807#false] [2018-02-02 20:10:02,769 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 20:10:02,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:10:02,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:10:02,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:10:02,770 INFO L87 Difference]: Start difference. First operand 503 states and 685 transitions. Second operand 12 states. [2018-02-02 20:10:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:03,287 INFO L93 Difference]: Finished difference Result 676 states and 884 transitions. [2018-02-02 20:10:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:10:03,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-02-02 20:10:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:03,288 INFO L225 Difference]: With dead ends: 676 [2018-02-02 20:10:03,288 INFO L226 Difference]: Without dead ends: 676 [2018-02-02 20:10:03,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:10:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-02-02 20:10:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 506. [2018-02-02 20:10:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-02 20:10:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 689 transitions. [2018-02-02 20:10:03,291 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 689 transitions. Word has length 50 [2018-02-02 20:10:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:03,291 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 689 transitions. [2018-02-02 20:10:03,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:10:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 689 transitions. [2018-02-02 20:10:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:03,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:03,292 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, 1] [2018-02-02 20:10:03,292 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1713231064, now seen corresponding path program 1 times [2018-02-02 20:10:03,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:03,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:03,957 INFO 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 20:10:03,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:03,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:10:03,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:03,958 INFO L182 omatonBuilderFactory]: Interpolants [55040#(= 1 (select |#valid| |main_#t~mem42.base|)), 55022#true, 55023#false, 55024#(= 0 |main_#t~malloc0.offset|), 55025#(= 0 main_~tree~0.offset), 55026#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 55027#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 55028#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55029#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55030#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55031#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 55032#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tree~0.base |main_#t~malloc30.base|)) (= main_~tree~0.base main_~tmp~0.base)), 55033#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 55034#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 55035#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 55036#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 55037#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 55038#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55039#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))] [2018-02-02 20:10:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:03,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:10:03,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:10:03,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:10:03,959 INFO L87 Difference]: Start difference. First operand 506 states and 689 transitions. Second operand 19 states. [2018-02-02 20:10:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:05,393 INFO L93 Difference]: Finished difference Result 921 states and 1198 transitions. [2018-02-02 20:10:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:10:05,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-02 20:10:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:05,394 INFO L225 Difference]: With dead ends: 921 [2018-02-02 20:10:05,394 INFO L226 Difference]: Without dead ends: 921 [2018-02-02 20:10:05,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:10:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-02-02 20:10:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 571. [2018-02-02 20:10:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-02-02 20:10:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 781 transitions. [2018-02-02 20:10:05,401 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 781 transitions. Word has length 53 [2018-02-02 20:10:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:05,401 INFO L432 AbstractCegarLoop]: Abstraction has 571 states and 781 transitions. [2018-02-02 20:10:05,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:10:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 781 transitions. [2018-02-02 20:10:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:05,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:05,402 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, 1] [2018-02-02 20:10:05,402 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:05,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1713231065, now seen corresponding path program 1 times [2018-02-02 20:10:05,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:05,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:05,865 INFO 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 20:10:05,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:05,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:10:05,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:05,866 INFO 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 20:10:05,866 INFO L182 omatonBuilderFactory]: Interpolants [56576#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 56577#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 56578#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 56579#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 56580#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 56581#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 56582#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 56583#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 56584#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 56585#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 56586#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 56587#(and (= (select |#length| |main_#t~mem42.base|) 4) (= |main_#t~mem42.offset| 0)), 56569#true, 56570#false, 56571#(= 0 |main_#t~malloc0.offset|), 56572#(= 0 main_~tree~0.offset), 56573#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 56574#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset) (= 4 (select |#length| |main_#t~malloc3.base|))), 56575#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-02 20:10:05,866 INFO 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 20:10:05,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:10:05,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:10:05,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:10:05,866 INFO L87 Difference]: Start difference. First operand 571 states and 781 transitions. Second operand 19 states. [2018-02-02 20:10:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:07,590 INFO L93 Difference]: Finished difference Result 920 states and 1197 transitions. [2018-02-02 20:10:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:10:07,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-02 20:10:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:07,591 INFO L225 Difference]: With dead ends: 920 [2018-02-02 20:10:07,591 INFO L226 Difference]: Without dead ends: 920 [2018-02-02 20:10:07,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:10:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-02-02 20:10:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 567. [2018-02-02 20:10:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-02 20:10:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 776 transitions. [2018-02-02 20:10:07,595 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 776 transitions. Word has length 53 [2018-02-02 20:10:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:07,595 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 776 transitions. [2018-02-02 20:10:07,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:10:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 776 transitions. [2018-02-02 20:10:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:07,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:07,596 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, 1, 1, 1] [2018-02-02 20:10:07,596 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash -146453375, now seen corresponding path program 1 times [2018-02-02 20:10:07,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:07,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:07,676 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 20:10:07,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:07,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:10:07,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:07,677 INFO 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 20:10:07,677 INFO L182 omatonBuilderFactory]: Interpolants [58113#true, 58114#false, 58115#(= 0 |main_#t~malloc0.offset|), 58116#(= 0 main_~tree~0.offset), 58117#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 58118#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.base main_~tree~0.base) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 58119#(and (<= (+ main_~tree~0.offset 12) (select |#length| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base)), 58120#(and (<= (+ main_~tree~0.offset 12) (select |#length| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base)), 58121#(and (= 0 main_~tree~0.offset) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 58122#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0))] [2018-02-02 20:10:07,677 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 20:10:07,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:07,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:07,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:07,678 INFO L87 Difference]: Start difference. First operand 567 states and 776 transitions. Second operand 10 states. [2018-02-02 20:10:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:08,072 INFO L93 Difference]: Finished difference Result 864 states and 1085 transitions. [2018-02-02 20:10:08,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:10:08,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 20:10:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:08,074 INFO L225 Difference]: With dead ends: 864 [2018-02-02 20:10:08,074 INFO L226 Difference]: Without dead ends: 864 [2018-02-02 20:10:08,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:10:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-02-02 20:10:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 440. [2018-02-02 20:10:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 20:10:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 560 transitions. [2018-02-02 20:10:08,080 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 560 transitions. Word has length 53 [2018-02-02 20:10:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:08,081 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 560 transitions. [2018-02-02 20:10:08,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 560 transitions. [2018-02-02 20:10:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:08,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:08,082 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, 1] [2018-02-02 20:10:08,082 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1882204834, now seen corresponding path program 1 times [2018-02-02 20:10:08,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:08,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:08,225 INFO 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 20:10:08,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:08,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:10:08,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:08,225 INFO 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 20:10:08,226 INFO L182 omatonBuilderFactory]: Interpolants [59441#true, 59442#false, 59443#(= 0 |main_#t~malloc0.offset|), 59444#(= main_~tree~0.offset 0), 59445#(and (= main_~tree~0.offset 0) (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4))), 59446#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#length| main_~tree~0.base) 4))), 59447#(and (= main_~tree~0.offset 0) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base))), 59448#(and (= main_~tree~0.offset 0) (not (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 59449#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 59450#(= 1 (select |#valid| |main_#t~mem45.base|))] [2018-02-02 20:10:08,226 INFO 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 20:10:08,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:08,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:08,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:08,226 INFO L87 Difference]: Start difference. First operand 440 states and 560 transitions. Second operand 10 states. [2018-02-02 20:10:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:08,747 INFO L93 Difference]: Finished difference Result 666 states and 827 transitions. [2018-02-02 20:10:08,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:10:08,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 20:10:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:08,748 INFO L225 Difference]: With dead ends: 666 [2018-02-02 20:10:08,748 INFO L226 Difference]: Without dead ends: 666 [2018-02-02 20:10:08,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:10:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-02 20:10:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 439. [2018-02-02 20:10:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 20:10:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 559 transitions. [2018-02-02 20:10:08,751 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 559 transitions. Word has length 53 [2018-02-02 20:10:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:08,751 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 559 transitions. [2018-02-02 20:10:08,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 559 transitions. [2018-02-02 20:10:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:08,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:08,751 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, 1] [2018-02-02 20:10:08,752 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1882204835, now seen corresponding path program 1 times [2018-02-02 20:10:08,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:08,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:08,875 INFO 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 20:10:08,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:08,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:10:08,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:08,876 INFO 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 20:10:08,876 INFO L182 omatonBuilderFactory]: Interpolants [60576#(and (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4)) (or (= main_~tree~0.offset 0) (not (= (select |#length| main_~tree~0.base) 4)))), 60577#(or (and (= main_~tree~0.offset 0) (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base))), 60578#(and (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 60579#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 60580#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 60581#(and (<= 0 |main_#t~mem45.offset|) (<= (+ |main_#t~mem45.offset| 4) (select |#length| |main_#t~mem45.base|))), 60572#true, 60573#false, 60574#(= 0 |main_#t~malloc0.offset|), 60575#(= main_~tree~0.offset 0)] [2018-02-02 20:10:08,876 INFO 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 20:10:08,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:08,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:08,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:08,876 INFO L87 Difference]: Start difference. First operand 439 states and 559 transitions. Second operand 10 states. [2018-02-02 20:10:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:09,295 INFO L93 Difference]: Finished difference Result 665 states and 826 transitions. [2018-02-02 20:10:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:10:09,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 20:10:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:09,297 INFO L225 Difference]: With dead ends: 665 [2018-02-02 20:10:09,297 INFO L226 Difference]: Without dead ends: 665 [2018-02-02 20:10:09,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:10:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-02 20:10:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 438. [2018-02-02 20:10:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 20:10:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 558 transitions. [2018-02-02 20:10:09,300 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 558 transitions. Word has length 53 [2018-02-02 20:10:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:09,300 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 558 transitions. [2018-02-02 20:10:09,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 558 transitions. [2018-02-02 20:10:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:09,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:09,301 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] [2018-02-02 20:10:09,301 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1116441486, now seen corresponding path program 1 times [2018-02-02 20:10:09,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:09,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:09,442 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 20:10:09,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:09,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:10:09,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:09,442 INFO 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 20:10:09,443 INFO L182 omatonBuilderFactory]: Interpolants [61701#true, 61702#false, 61703#(= 1 (select |#valid| main_~tree~0.base)), 61704#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 61705#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 61706#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 61707#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61708#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61709#(and (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61710#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|))), 61711#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61712#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 61713#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 61714#(= 1 (select |#valid| |main_#t~mem60.base|)), 61715#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-02 20:10:09,443 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 20:10:09,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:09,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:09,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:09,443 INFO L87 Difference]: Start difference. First operand 438 states and 558 transitions. Second operand 15 states. [2018-02-02 20:10:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:10,146 INFO L93 Difference]: Finished difference Result 725 states and 869 transitions. [2018-02-02 20:10:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:10:10,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-02 20:10:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:10,147 INFO L225 Difference]: With dead ends: 725 [2018-02-02 20:10:10,147 INFO L226 Difference]: Without dead ends: 725 [2018-02-02 20:10:10,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:10:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-02-02 20:10:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 443. [2018-02-02 20:10:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:10:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 564 transitions. [2018-02-02 20:10:10,150 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 564 transitions. Word has length 53 [2018-02-02 20:10:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:10,150 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 564 transitions. [2018-02-02 20:10:10,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 564 transitions. [2018-02-02 20:10:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:10:10,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:10,151 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] [2018-02-02 20:10:10,151 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1116441485, now seen corresponding path program 1 times [2018-02-02 20:10:10,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:10,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:10,346 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 20:10:10,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:10,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:10:10,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:10,347 INFO 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 20:10:10,347 INFO L182 omatonBuilderFactory]: Interpolants [62916#true, 62917#false, 62918#(= 1 (select |#valid| main_~tree~0.base)), 62919#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 62920#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 62921#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 62922#(and (= 0 |main_#t~malloc9.offset|) (= 4 (select |#length| |main_#t~malloc9.base|)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62923#(and (= 0 main_~tmpList~0.offset) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62924#(and (= 0 main_~tmpList~0.offset) (= 4 (select |#length| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62925#(and (= 0 main_~tmpList~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|))), 62926#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 62927#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 62928#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|))), 62929#(and (= 4 (select |#length| |main_#t~mem60.base|)) (= 0 |main_#t~mem60.offset|)), 62930#(and (= (select |#length| main_~tmpList~0.base) 4) (= main_~tmpList~0.offset 0))] [2018-02-02 20:10:10,347 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 20:10:10,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:10,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:10,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:10,348 INFO L87 Difference]: Start difference. First operand 443 states and 564 transitions. Second operand 15 states. [2018-02-02 20:10:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:10,957 INFO L93 Difference]: Finished difference Result 582 states and 694 transitions. [2018-02-02 20:10:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:10:10,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-02 20:10:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:10,957 INFO L225 Difference]: With dead ends: 582 [2018-02-02 20:10:10,958 INFO L226 Difference]: Without dead ends: 582 [2018-02-02 20:10:10,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:10:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-02-02 20:10:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 446. [2018-02-02 20:10:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 20:10:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 568 transitions. [2018-02-02 20:10:10,960 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 568 transitions. Word has length 53 [2018-02-02 20:10:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:10,961 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 568 transitions. [2018-02-02 20:10:10,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 568 transitions. [2018-02-02 20:10:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:10:10,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:10,961 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] [2018-02-02 20:10:10,961 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash -249947414, now seen corresponding path program 1 times [2018-02-02 20:10:10,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:10,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:10,985 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 20:10:10,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:10,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:10,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:10,986 INFO L182 omatonBuilderFactory]: Interpolants [63984#false, 63985#(= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 63986#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 63987#(= 1 (select |#valid| |main_#t~mem61.base|)), 63983#true] [2018-02-02 20:10:10,986 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 20:10:10,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:10,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:10,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:10,986 INFO L87 Difference]: Start difference. First operand 446 states and 568 transitions. Second operand 5 states. [2018-02-02 20:10:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:11,137 INFO L93 Difference]: Finished difference Result 445 states and 564 transitions. [2018-02-02 20:10:11,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:10:11,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-02-02 20:10:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:11,138 INFO L225 Difference]: With dead ends: 445 [2018-02-02 20:10:11,138 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:10:11,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:10:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:10:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-02-02 20:10:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 20:10:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 564 transitions. [2018-02-02 20:10:11,141 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 564 transitions. Word has length 54 [2018-02-02 20:10:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:11,141 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 564 transitions. [2018-02-02 20:10:11,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 564 transitions. [2018-02-02 20:10:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:10:11,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:11,141 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] [2018-02-02 20:10:11,142 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash -249947413, now seen corresponding path program 1 times [2018-02-02 20:10:11,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:11,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:11,224 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 20:10:11,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:11,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:10:11,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:11,225 INFO 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 20:10:11,225 INFO L182 omatonBuilderFactory]: Interpolants [64882#true, 64883#false, 64884#(= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 64885#(and (<= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem59.offset|)), 64886#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 64887#(and (<= 0 |main_#t~mem61.offset|) (<= (+ |main_#t~mem61.offset| 4) (select |#length| |main_#t~mem61.base|)))] [2018-02-02 20:10:11,225 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 20:10:11,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:10:11,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:10:11,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:10:11,226 INFO L87 Difference]: Start difference. First operand 445 states and 564 transitions. Second operand 6 states. [2018-02-02 20:10:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:11,382 INFO L93 Difference]: Finished difference Result 444 states and 560 transitions. [2018-02-02 20:10:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:10:11,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-02-02 20:10:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:11,383 INFO L225 Difference]: With dead ends: 444 [2018-02-02 20:10:11,383 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 20:10:11,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 20:10:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2018-02-02 20:10:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-02 20:10:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 560 transitions. [2018-02-02 20:10:11,386 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 560 transitions. Word has length 54 [2018-02-02 20:10:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:11,386 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 560 transitions. [2018-02-02 20:10:11,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:10:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 560 transitions. [2018-02-02 20:10:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:10:11,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:11,387 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] [2018-02-02 20:10:11,387 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 682972618, now seen corresponding path program 1 times [2018-02-02 20:10:11,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:11,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:11,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:11,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:10:11,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:11,699 INFO 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 20:10:11,699 INFO L182 omatonBuilderFactory]: Interpolants [65793#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 65792#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 65795#(not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 65794#(and (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem58.base|)))), 65796#(not (= |main_#t~mem64.offset| 0)), 65781#false, 65780#true, 65783#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 65782#(= 1 (select |#valid| main_~tree~0.base)), 65785#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 65784#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 65787#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc9.base|)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 65786#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 65789#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 65788#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 65791#(not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))), 65790#(not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))] [2018-02-02 20:10:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:11,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:10:11,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:10:11,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:10:11,699 INFO L87 Difference]: Start difference. First operand 444 states and 560 transitions. Second operand 17 states. [2018-02-02 20:10:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:12,530 INFO L93 Difference]: Finished difference Result 548 states and 658 transitions. [2018-02-02 20:10:12,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:10:12,530 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 20:10:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:12,532 INFO L225 Difference]: With dead ends: 548 [2018-02-02 20:10:12,532 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 20:10:12,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:10:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 20:10:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 442. [2018-02-02 20:10:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 20:10:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-02-02 20:10:12,536 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 56 [2018-02-02 20:10:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:12,536 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-02-02 20:10:12,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:10:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-02-02 20:10:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:10:12,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:12,537 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 20:10:12,537 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1340433773, now seen corresponding path program 1 times [2018-02-02 20:10:12,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:12,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:13,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:13,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:10:13,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:13,021 INFO 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 20:10:13,021 INFO L182 omatonBuilderFactory]: Interpolants [66819#true, 66821#(= 0 |main_#t~malloc0.offset|), 66820#false, 66823#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 66822#(= 0 main_~tree~0.offset), 66825#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66824#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 66827#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 66826#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66829#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66828#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 66831#(and (= 1 (select |#valid| main_~tree~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))), 66830#(and (= 1 (select |#valid| main_~tree~0.base)) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 66833#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 66832#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 66835#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 66834#(and (= 0 |main_#t~mem56.offset|) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 66837#(and (or (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= 1 (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem59.offset|))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 66836#(and (or (and (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 66839#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) main_~tmp~0.base))) (= main_~tmp~0.offset 0)), 66838#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= main_~tmp~0.base |main_#t~mem60.base|)) (and (not (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 |main_#t~mem60.offset|))), 66841#(= (select |#valid| main_~tmp~0.base) 1), 66840#(or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) main_~tmp~0.base)))] [2018-02-02 20:10:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:13,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:10:13,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:10:13,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:10:13,022 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 23 states. [2018-02-02 20:10:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:14,384 INFO L93 Difference]: Finished difference Result 579 states and 690 transitions. [2018-02-02 20:10:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:10:14,384 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-02-02 20:10:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:14,385 INFO L225 Difference]: With dead ends: 579 [2018-02-02 20:10:14,385 INFO L226 Difference]: Without dead ends: 579 [2018-02-02 20:10:14,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:10:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-02 20:10:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 442. [2018-02-02 20:10:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 20:10:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-02-02 20:10:14,389 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 58 [2018-02-02 20:10:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:14,389 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-02-02 20:10:14,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:10:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-02-02 20:10:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:10:14,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:14,390 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:14,390 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash -675463713, now seen corresponding path program 1 times [2018-02-02 20:10:14,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:14,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:14,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:14,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:10:14,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:14,544 INFO L182 omatonBuilderFactory]: Interpolants [67917#true, 67919#(= (select |#valid| main_~tree~0.base) 1), 67918#false, 67921#(and (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 67920#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 67923#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 67922#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 67925#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 67924#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 67927#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))), 67926#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| main_~newNode~0.base)) (not (= |main_#t~mem37.base| main_~tree~0.base))), 67929#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 67928#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))), 67931#(= 1 (select |#valid| main_~tmp~0.base)), 67930#(= 1 (select |#valid| |main_#t~mem20.base|))] [2018-02-02 20:10:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:14,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:14,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:14,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:14,545 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 15 states. [2018-02-02 20:10:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:15,657 INFO L93 Difference]: Finished difference Result 1044 states and 1267 transitions. [2018-02-02 20:10:15,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:10:15,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-02 20:10:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:15,658 INFO L225 Difference]: With dead ends: 1044 [2018-02-02 20:10:15,658 INFO L226 Difference]: Without dead ends: 1044 [2018-02-02 20:10:15,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:10:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2018-02-02 20:10:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 504. [2018-02-02 20:10:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-02 20:10:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 644 transitions. [2018-02-02 20:10:15,662 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 644 transitions. Word has length 60 [2018-02-02 20:10:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:15,662 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 644 transitions. [2018-02-02 20:10:15,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 644 transitions. [2018-02-02 20:10:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:10:15,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:15,662 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:15,663 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:15,663 INFO L82 PathProgramCache]: Analyzing trace with hash -675463712, now seen corresponding path program 1 times [2018-02-02 20:10:15,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:15,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:15,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:15,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:10:15,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:15,870 INFO L182 omatonBuilderFactory]: Interpolants [69521#false, 69520#true, 69523#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 69522#(= (select |#valid| main_~tree~0.base) 1), 69525#(and (= 0 main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 69524#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 69527#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 69526#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 69529#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 69528#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 69531#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 69530#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base))), 69533#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 69532#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 69535#(and (= (select |#length| main_~tmp~0.base) 12) (= main_~tmp~0.offset 0)), 69534#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|)))] [2018-02-02 20:10:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:15,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:10:15,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:10:15,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:10:15,870 INFO L87 Difference]: Start difference. First operand 504 states and 644 transitions. Second operand 16 states. [2018-02-02 20:10:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:17,294 INFO L93 Difference]: Finished difference Result 976 states and 1188 transitions. [2018-02-02 20:10:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:10:17,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-02 20:10:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:17,295 INFO L225 Difference]: With dead ends: 976 [2018-02-02 20:10:17,295 INFO L226 Difference]: Without dead ends: 976 [2018-02-02 20:10:17,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:10:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-02-02 20:10:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 533. [2018-02-02 20:10:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-02-02 20:10:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 681 transitions. [2018-02-02 20:10:17,299 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 681 transitions. Word has length 60 [2018-02-02 20:10:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:17,299 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 681 transitions. [2018-02-02 20:10:17,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:10:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 681 transitions. [2018-02-02 20:10:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:10:17,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:17,300 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:17,300 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -669738075, now seen corresponding path program 1 times [2018-02-02 20:10:17,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:17,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:17,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:17,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:10:17,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:17,866 INFO 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 20:10:17,866 INFO L182 omatonBuilderFactory]: Interpolants [71105#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 71104#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 71106#(not |main_#t~short18|), 71083#true, 71085#(= 0 |main_#t~malloc0.offset|), 71084#false, 71087#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 71086#(= 0 main_~tree~0.offset), 71089#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 71088#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 71091#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 71090#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 71093#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem16.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71092#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71095#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71094#(and (or |main_#t~short18| (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))))) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71097#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset)) main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 4)))), 71096#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~malloc25.offset|) (= main_~tmp~0.base main_~tree~0.base)), 71099#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 71098#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 71101#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 71100#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 71103#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 71102#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))))] [2018-02-02 20:10:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:17,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:10:17,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:10:17,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:17,866 INFO L87 Difference]: Start difference. First operand 533 states and 681 transitions. Second operand 24 states. [2018-02-02 20:10:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:20,032 INFO L93 Difference]: Finished difference Result 1059 states and 1277 transitions. [2018-02-02 20:10:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:10:20,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-02-02 20:10:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:20,032 INFO L225 Difference]: With dead ends: 1059 [2018-02-02 20:10:20,032 INFO L226 Difference]: Without dead ends: 1059 [2018-02-02 20:10:20,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=948, Invalid=2834, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:10:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-02-02 20:10:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 584. [2018-02-02 20:10:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-02-02 20:10:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 745 transitions. [2018-02-02 20:10:20,036 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 745 transitions. Word has length 60 [2018-02-02 20:10:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:20,036 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 745 transitions. [2018-02-02 20:10:20,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:10:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 745 transitions. [2018-02-02 20:10:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:10:20,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:20,037 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] [2018-02-02 20:10:20,037 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -333324624, now seen corresponding path program 1 times [2018-02-02 20:10:20,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:20,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:20,513 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 20:10:20,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:20,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:10:20,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:20,513 INFO 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 20:10:20,513 INFO L182 omatonBuilderFactory]: Interpolants [72833#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 72832#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 72835#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 72834#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 72837#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 main_~tree~0.offset)), 72836#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 72839#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 72838#(and (= main_~tmp~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 72841#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72840#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.offset| |main_#t~mem56.offset|) (= main_~tmp~0.offset 0) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| |main_#t~mem56.base|) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 72843#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72842#(and (= main_~tmp~0.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72845#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0)), 72844#(and (or (and (not (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= |main_#t~mem60.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (= |main_#t~mem60.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72847#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (or (and (= |main_#t~mem63.base| (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (= main_~tmpList~0.offset (+ main_~tmp~0.offset 8)) (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmp~0.base |main_#t~mem61.base|)) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 72846#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (= main_~tmpList~0.offset (+ main_~tmp~0.offset 8)) (= main_~tmpList~0.base main_~tmp~0.base)) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (= main_~tmp~0.offset 0) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 72849#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72848#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72850#(= 1 (select |#valid| |main_#t~mem56.base|)), 72827#false, 72826#true, 72829#(= 0 main_~tree~0.offset), 72828#(= 0 |main_#t~malloc0.offset|), 72831#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= |main_#t~malloc3.offset| 0) (= 0 main_~tree~0.offset)), 72830#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset))] [2018-02-02 20:10:20,513 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 20:10:20,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:10:20,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:10:20,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:10:20,514 INFO L87 Difference]: Start difference. First operand 584 states and 745 transitions. Second operand 25 states. [2018-02-02 20:10:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:21,856 INFO L93 Difference]: Finished difference Result 717 states and 874 transitions. [2018-02-02 20:10:21,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:10:21,856 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-02-02 20:10:21,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:21,857 INFO L225 Difference]: With dead ends: 717 [2018-02-02 20:10:21,857 INFO L226 Difference]: Without dead ends: 717 [2018-02-02 20:10:21,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=2359, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:10:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-02-02 20:10:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 588. [2018-02-02 20:10:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-02-02 20:10:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 750 transitions. [2018-02-02 20:10:21,860 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 750 transitions. Word has length 60 [2018-02-02 20:10:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:21,860 INFO L432 AbstractCegarLoop]: Abstraction has 588 states and 750 transitions. [2018-02-02 20:10:21,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:10:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 750 transitions. [2018-02-02 20:10:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:10:21,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:21,861 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] [2018-02-02 20:10:21,861 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash -333324623, now seen corresponding path program 1 times [2018-02-02 20:10:21,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:21,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:22,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:22,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:10:22,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:22,294 INFO 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 20:10:22,295 INFO L182 omatonBuilderFactory]: Interpolants [74213#false, 74212#true, 74215#(= 0 main_~tree~0.offset), 74214#(= 0 |main_#t~malloc0.offset|), 74217#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74216#(= main_~tmp~0.offset 0), 74219#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| |main_#t~mem59.base|)) (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74218#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74221#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74220#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem60.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem60.base|)), 74223#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem63.offset|) (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|)))), 74222#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (or (= main_~tmp~0.offset 0) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (or (and (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|)))))), 74225#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74224#(or (and (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 74226#(and (<= 0 |main_#t~mem56.offset|) (<= (+ |main_#t~mem56.offset| 4) (select |#length| |main_#t~mem56.base|)))] [2018-02-02 20:10:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:22,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:22,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:22,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:22,295 INFO L87 Difference]: Start difference. First operand 588 states and 750 transitions. Second operand 15 states. [2018-02-02 20:10:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:22,917 INFO L93 Difference]: Finished difference Result 665 states and 826 transitions. [2018-02-02 20:10:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:10:22,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-02 20:10:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:22,918 INFO L225 Difference]: With dead ends: 665 [2018-02-02 20:10:22,918 INFO L226 Difference]: Without dead ends: 665 [2018-02-02 20:10:22,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:10:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-02 20:10:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 590. [2018-02-02 20:10:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-02-02 20:10:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 752 transitions. [2018-02-02 20:10:22,922 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 752 transitions. Word has length 60 [2018-02-02 20:10:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:22,922 INFO L432 AbstractCegarLoop]: Abstraction has 590 states and 752 transitions. [2018-02-02 20:10:22,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 752 transitions. [2018-02-02 20:10:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:22,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:22,923 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] [2018-02-02 20:10:22,923 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1271133541, now seen corresponding path program 1 times [2018-02-02 20:10:22,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:22,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:23,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:23,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:10:23,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:23,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 20:10:23,093 INFO L182 omatonBuilderFactory]: Interpolants [75520#(= 1 (select |#valid| main_~tmp~0.base)), 75507#false, 75506#true, 75509#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 75508#(= (select |#valid| main_~tree~0.base) 1), 75511#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 75510#(and (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 75513#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 75512#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 75515#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 75514#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 75517#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))), 75516#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))), 75519#(= 1 (select |#valid| |main_#t~mem51.base|)), 75518#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-02-02 20:10:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:23,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:23,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:23,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:23,094 INFO L87 Difference]: Start difference. First operand 590 states and 752 transitions. Second operand 15 states. [2018-02-02 20:10:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:24,224 INFO L93 Difference]: Finished difference Result 1177 states and 1434 transitions. [2018-02-02 20:10:24,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:10:24,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-02-02 20:10:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:24,225 INFO L225 Difference]: With dead ends: 1177 [2018-02-02 20:10:24,225 INFO L226 Difference]: Without dead ends: 1177 [2018-02-02 20:10:24,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:10:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-02-02 20:10:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 603. [2018-02-02 20:10:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-02-02 20:10:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 768 transitions. [2018-02-02 20:10:24,229 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 768 transitions. Word has length 61 [2018-02-02 20:10:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:24,230 INFO L432 AbstractCegarLoop]: Abstraction has 603 states and 768 transitions. [2018-02-02 20:10:24,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 768 transitions. [2018-02-02 20:10:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:24,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:24,230 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] [2018-02-02 20:10:24,230 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1271133542, now seen corresponding path program 1 times [2018-02-02 20:10:24,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:24,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:24,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:24,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:10:24,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:24,420 INFO L182 omatonBuilderFactory]: Interpolants [77345#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 77344#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 77347#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 77346#(and (= 0 main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 77349#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 77348#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 77351#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base))), 77350#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 77353#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 77352#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 77355#(and (= 12 (select |#length| |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|)), 77354#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 77356#(and (= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 77341#true, 77343#(= (select |#valid| main_~tree~0.base) 1), 77342#false] [2018-02-02 20:10:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:24,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:10:24,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:10:24,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:10:24,421 INFO L87 Difference]: Start difference. First operand 603 states and 768 transitions. Second operand 16 states. [2018-02-02 20:10:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:25,908 INFO L93 Difference]: Finished difference Result 1154 states and 1400 transitions. [2018-02-02 20:10:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:10:25,908 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-02 20:10:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:25,909 INFO L225 Difference]: With dead ends: 1154 [2018-02-02 20:10:25,909 INFO L226 Difference]: Without dead ends: 1154 [2018-02-02 20:10:25,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:10:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-02-02 20:10:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 647. [2018-02-02 20:10:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-02-02 20:10:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 837 transitions. [2018-02-02 20:10:25,913 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 837 transitions. Word has length 61 [2018-02-02 20:10:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:25,913 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 837 transitions. [2018-02-02 20:10:25,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:10:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 837 transitions. [2018-02-02 20:10:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:25,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:25,914 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] [2018-02-02 20:10:25,914 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1276859179, now seen corresponding path program 1 times [2018-02-02 20:10:25,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:25,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:25,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:25,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:10:25,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:25,948 INFO 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 20:10:25,948 INFO L182 omatonBuilderFactory]: Interpolants [79201#(or (not (= 0 |main_#t~mem50.offset|)) (not (= |main_#t~mem50.base| 0))), 79200#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 79197#false, 79196#true, 79199#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))) (not |main_#t~short49|) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 79198#(and (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-02-02 20:10:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:25,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:10:25,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:10:25,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:10:25,949 INFO L87 Difference]: Start difference. First operand 647 states and 837 transitions. Second operand 6 states. [2018-02-02 20:10:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:26,071 INFO L93 Difference]: Finished difference Result 648 states and 834 transitions. [2018-02-02 20:10:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:10:26,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 20:10:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:26,072 INFO L225 Difference]: With dead ends: 648 [2018-02-02 20:10:26,072 INFO L226 Difference]: Without dead ends: 648 [2018-02-02 20:10:26,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:10:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-02-02 20:10:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 647. [2018-02-02 20:10:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-02-02 20:10:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 834 transitions. [2018-02-02 20:10:26,075 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 834 transitions. Word has length 61 [2018-02-02 20:10:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:26,075 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 834 transitions. [2018-02-02 20:10:26,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:10:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 834 transitions. [2018-02-02 20:10:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:26,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:26,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:26,076 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1234041873, now seen corresponding path program 1 times [2018-02-02 20:10:26,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:26,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:26,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:26,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:10:26,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:26,145 INFO 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 20:10:26,145 INFO L182 omatonBuilderFactory]: Interpolants [80503#true, 80505#(= 1 (select |#valid| main_~tmpList~0.base)), 80504#false, 80507#(or (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 80506#(and (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem45.base|)) (not (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|)))), 80508#(= 1 (select |#valid| |main_#t~mem42.base|))] [2018-02-02 20:10:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:26,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:10:26,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:10:26,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:10:26,145 INFO L87 Difference]: Start difference. First operand 647 states and 834 transitions. Second operand 6 states. [2018-02-02 20:10:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:26,369 INFO L93 Difference]: Finished difference Result 1058 states and 1351 transitions. [2018-02-02 20:10:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:10:26,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 20:10:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:26,370 INFO L225 Difference]: With dead ends: 1058 [2018-02-02 20:10:26,370 INFO L226 Difference]: Without dead ends: 1058 [2018-02-02 20:10:26,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-02-02 20:10:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 654. [2018-02-02 20:10:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-02-02 20:10:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 843 transitions. [2018-02-02 20:10:26,374 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 843 transitions. Word has length 61 [2018-02-02 20:10:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:26,374 INFO L432 AbstractCegarLoop]: Abstraction has 654 states and 843 transitions. [2018-02-02 20:10:26,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:10:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 843 transitions. [2018-02-02 20:10:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:26,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:26,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:26,375 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1234041874, now seen corresponding path program 1 times [2018-02-02 20:10:26,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:26,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:27,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:27,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:10:27,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:27,109 INFO L182 omatonBuilderFactory]: Interpolants [82241#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tree~0.base main_~tmp~0.base)), 82240#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 82243#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 82242#(and (= main_~tree~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (= main_~tmp~0.offset (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 82245#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 82244#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 82247#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 82246#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 82249#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4))), 82248#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0)), 82251#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 82250#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#length| main_~tree~0.base) 4)) (or (= main_~tree~0.base main_~tmpList~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 82253#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|))) (not (= main_~tree~0.base |main_#t~mem45.base|))) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) (+ main_~tree~0.offset 8))))) (= main_~tree~0.base |main_#t~mem45.base|))), 82252#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 82255#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 82254#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 82256#(and (= |main_#t~mem42.offset| 0) (<= 4 (select |#length| |main_#t~mem42.base|))), 82231#true, 82233#(= |main_#t~malloc0.offset| 0), 82232#false, 82235#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 82234#(= 0 main_~tree~0.offset), 82237#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 82236#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= main_~tree~0.offset |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 82239#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 82238#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-02 20:10:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:27,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:10:27,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:10:27,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:10:27,110 INFO L87 Difference]: Start difference. First operand 654 states and 843 transitions. Second operand 26 states. [2018-02-02 20:10:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:34,924 INFO L93 Difference]: Finished difference Result 4346 states and 5226 transitions. [2018-02-02 20:10:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-02-02 20:10:34,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 20:10:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:34,926 INFO L225 Difference]: With dead ends: 4346 [2018-02-02 20:10:34,926 INFO L226 Difference]: Without dead ends: 4346 [2018-02-02 20:10:34,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4881, Invalid=17769, Unknown=0, NotChecked=0, Total=22650 [2018-02-02 20:10:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2018-02-02 20:10:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 853. [2018-02-02 20:10:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-02-02 20:10:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1122 transitions. [2018-02-02 20:10:34,940 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1122 transitions. Word has length 61 [2018-02-02 20:10:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:34,940 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 1122 transitions. [2018-02-02 20:10:34,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:10:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1122 transitions. [2018-02-02 20:10:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:34,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:34,940 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 20:10:34,940 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1869077753, now seen corresponding path program 1 times [2018-02-02 20:10:34,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:34,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:35,430 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 20:10:35,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:35,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:10:35,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:35,431 INFO L182 omatonBuilderFactory]: Interpolants [87713#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87712#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87715#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 87714#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 87717#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87716#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87719#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 87718#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 87721#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 87720#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 87723#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 87722#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 87725#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 87724#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 87727#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 87726#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 87729#(= 1 (select |#valid| |main_#t~mem42.base|)), 87728#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 87707#false, 87706#true, 87709#(= 0 main_~tree~0.offset), 87708#(= 0 |main_#t~malloc0.offset|), 87711#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 87710#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset))] [2018-02-02 20:10:35,431 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 20:10:35,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:10:35,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:10:35,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:35,431 INFO L87 Difference]: Start difference. First operand 853 states and 1122 transitions. Second operand 24 states. [2018-02-02 20:10:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:37,610 INFO L93 Difference]: Finished difference Result 1685 states and 2112 transitions. [2018-02-02 20:10:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:10:37,610 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-02 20:10:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:37,611 INFO L225 Difference]: With dead ends: 1685 [2018-02-02 20:10:37,611 INFO L226 Difference]: Without dead ends: 1685 [2018-02-02 20:10:37,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=949, Invalid=2833, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:10:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2018-02-02 20:10:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 928. [2018-02-02 20:10:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-02-02 20:10:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1225 transitions. [2018-02-02 20:10:37,617 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1225 transitions. Word has length 61 [2018-02-02 20:10:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:37,617 INFO L432 AbstractCegarLoop]: Abstraction has 928 states and 1225 transitions. [2018-02-02 20:10:37,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:10:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1225 transitions. [2018-02-02 20:10:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:37,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:37,617 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 20:10:37,617 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1869077752, now seen corresponding path program 1 times [2018-02-02 20:10:37,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:37,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:38,211 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 20:10:38,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:38,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:10:38,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:38,212 INFO 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 20:10:38,212 INFO L182 omatonBuilderFactory]: Interpolants [90433#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 90432#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 90435#(and (<= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 90434#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base)), 90437#(and (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 90436#(and (not (= main_~newNode~0.base main_~tree~0.base)) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 90439#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 90438#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 90441#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 90440#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 90442#(and (= |main_#t~mem42.offset| 0) (<= 4 (select |#length| |main_#t~mem42.base|))), 90419#true, 90421#(= 0 |main_#t~malloc0.offset|), 90420#false, 90423#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 90422#(= 0 main_~tree~0.offset), 90425#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 90424#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 90427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 90426#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 90429#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 90428#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 90431#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 90430#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-02 20:10:38,212 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 20:10:38,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:10:38,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:10:38,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:38,212 INFO L87 Difference]: Start difference. First operand 928 states and 1225 transitions. Second operand 24 states. [2018-02-02 20:10:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:40,989 INFO L93 Difference]: Finished difference Result 1672 states and 2099 transitions. [2018-02-02 20:10:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:10:40,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-02 20:10:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:40,990 INFO L225 Difference]: With dead ends: 1672 [2018-02-02 20:10:40,990 INFO L226 Difference]: Without dead ends: 1672 [2018-02-02 20:10:40,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=765, Invalid=2315, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:10:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-02-02 20:10:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 932. [2018-02-02 20:10:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-02-02 20:10:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1229 transitions. [2018-02-02 20:10:40,996 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1229 transitions. Word has length 61 [2018-02-02 20:10:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:40,997 INFO L432 AbstractCegarLoop]: Abstraction has 932 states and 1229 transitions. [2018-02-02 20:10:40,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:10:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1229 transitions. [2018-02-02 20:10:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:10:40,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:40,997 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] [2018-02-02 20:10:40,997 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash 810031820, now seen corresponding path program 1 times [2018-02-02 20:10:40,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:41,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:41,134 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 20:10:41,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:41,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:10:41,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:41,135 INFO L182 omatonBuilderFactory]: Interpolants [93121#(not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset) 0)), 93120#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0))), 93123#(not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0)), 93122#(not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)), 93125#|main_#t~short49|, 93124#(and (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 93111#true, 93113#(= (select |#valid| main_~tree~0.base) 1), 93112#false, 93115#(and (not (= |main_#t~malloc25.base| 0)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 93114#(and (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 93117#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 93116#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (not (= main_~newNode~0.base 0)) (= main_~tmp~0.offset main_~tree~0.offset)), 93119#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 93118#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base |main_#t~malloc35.base|)))] [2018-02-02 20:10:41,135 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 20:10:41,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:41,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:41,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:41,135 INFO L87 Difference]: Start difference. First operand 932 states and 1229 transitions. Second operand 15 states. [2018-02-02 20:10:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:42,079 INFO L93 Difference]: Finished difference Result 1794 states and 2268 transitions. [2018-02-02 20:10:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:10:42,079 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 20:10:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:42,080 INFO L225 Difference]: With dead ends: 1794 [2018-02-02 20:10:42,080 INFO L226 Difference]: Without dead ends: 1794 [2018-02-02 20:10:42,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:10:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2018-02-02 20:10:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 932. [2018-02-02 20:10:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-02-02 20:10:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1228 transitions. [2018-02-02 20:10:42,086 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1228 transitions. Word has length 62 [2018-02-02 20:10:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:42,086 INFO L432 AbstractCegarLoop]: Abstraction has 932 states and 1228 transitions. [2018-02-02 20:10:42,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1228 transitions. [2018-02-02 20:10:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:10:42,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:42,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:42,087 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:42,087 INFO L82 PathProgramCache]: Analyzing trace with hash -109218273, now seen corresponding path program 1 times [2018-02-02 20:10:42,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:42,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:42,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:42,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:10:42,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:42,290 INFO 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 20:10:42,290 INFO L182 omatonBuilderFactory]: Interpolants [95905#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 95904#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 95907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 95906#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 95909#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= |main_#t~mem61.base| main_~tmp~0.base))), 95908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 95911#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 95910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select |#memory_$Pointer$.offset| main_~tmp~0.base) (select (store |#memory_$Pointer$.offset| |main_#t~mem61.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem61.base|) |main_#t~mem61.offset| |main_#t~mem63.offset|)) main_~tmp~0.base))), 95912#(= |main_#t~mem64.offset| 0), 95899#false, 95898#true, 95901#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 95900#(= 1 (select |#valid| main_~tree~0.base)), 95903#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 95902#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-02 20:10:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:42,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:42,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:42,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:42,291 INFO L87 Difference]: Start difference. First operand 932 states and 1228 transitions. Second operand 15 states. [2018-02-02 20:10:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:42,824 INFO L93 Difference]: Finished difference Result 1089 states and 1385 transitions. [2018-02-02 20:10:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:10:42,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-02 20:10:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:42,825 INFO L225 Difference]: With dead ends: 1089 [2018-02-02 20:10:42,825 INFO L226 Difference]: Without dead ends: 1089 [2018-02-02 20:10:42,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:10:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-02-02 20:10:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 947. [2018-02-02 20:10:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-02-02 20:10:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1249 transitions. [2018-02-02 20:10:42,829 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1249 transitions. Word has length 63 [2018-02-02 20:10:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:42,829 INFO L432 AbstractCegarLoop]: Abstraction has 947 states and 1249 transitions. [2018-02-02 20:10:42,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1249 transitions. [2018-02-02 20:10:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:10:42,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:42,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:42,830 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash -993978397, now seen corresponding path program 1 times [2018-02-02 20:10:42,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:42,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:43,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:43,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:10:43,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:43,054 INFO 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 20:10:43,054 INFO L182 omatonBuilderFactory]: Interpolants [97985#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 97984#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 97987#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 97986#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 97989#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 97988#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 97991#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 97990#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 97992#(not |main_#t~short18|), 97975#true, 97977#(= (select |#valid| main_~tree~0.base) 1), 97976#false, 97979#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 97978#(and (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 97981#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 97980#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1))), 97983#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 97982#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base))] [2018-02-02 20:10:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:43,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:10:43,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:10:43,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:10:43,054 INFO L87 Difference]: Start difference. First operand 947 states and 1249 transitions. Second operand 18 states. [2018-02-02 20:10:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:44,500 INFO L93 Difference]: Finished difference Result 1748 states and 2167 transitions. [2018-02-02 20:10:44,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:10:44,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-02-02 20:10:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:44,501 INFO L225 Difference]: With dead ends: 1748 [2018-02-02 20:10:44,501 INFO L226 Difference]: Without dead ends: 1748 [2018-02-02 20:10:44,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:10:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-02-02 20:10:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1052. [2018-02-02 20:10:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-02-02 20:10:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1373 transitions. [2018-02-02 20:10:44,507 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1373 transitions. Word has length 64 [2018-02-02 20:10:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:44,507 INFO L432 AbstractCegarLoop]: Abstraction has 1052 states and 1373 transitions. [2018-02-02 20:10:44,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:10:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1373 transitions. [2018-02-02 20:10:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:10:44,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:44,508 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] [2018-02-02 20:10:44,508 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash -12887071, now seen corresponding path program 1 times [2018-02-02 20:10:44,508 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:44,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:44,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:44,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:10:44,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:44,726 INFO 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 20:10:44,726 INFO L182 omatonBuilderFactory]: Interpolants [100835#false, 100834#true, 100837#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 100836#(= (select |#valid| main_~tree~0.base) 1), 100839#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)) |main_#t~short18|), 100838#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem16.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 100841#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 100840#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 100843#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 100842#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 100845#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 100844#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 100847#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 100846#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 100849#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 100848#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 100851#(not |main_#t~short49|), 100850#(and (= |main_#t~mem47.base| 0) (= 0 |main_#t~mem47.offset|))] [2018-02-02 20:10:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:44,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:10:44,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:10:44,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:10:44,726 INFO L87 Difference]: Start difference. First operand 1052 states and 1373 transitions. Second operand 18 states. [2018-02-02 20:10:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:46,268 INFO L93 Difference]: Finished difference Result 1684 states and 2080 transitions. [2018-02-02 20:10:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:10:46,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-02-02 20:10:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:46,269 INFO L225 Difference]: With dead ends: 1684 [2018-02-02 20:10:46,269 INFO L226 Difference]: Without dead ends: 1678 [2018-02-02 20:10:46,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=486, Invalid=1964, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:10:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-02-02 20:10:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1103. [2018-02-02 20:10:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2018-02-02 20:10:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1448 transitions. [2018-02-02 20:10:46,276 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1448 transitions. Word has length 65 [2018-02-02 20:10:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:46,276 INFO L432 AbstractCegarLoop]: Abstraction has 1103 states and 1448 transitions. [2018-02-02 20:10:46,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:10:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1448 transitions. [2018-02-02 20:10:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:10:46,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:46,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:46,277 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1879535647, now seen corresponding path program 1 times [2018-02-02 20:10:46,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:46,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:46,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:46,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:10:46,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:46,676 INFO 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 20:10:46,676 INFO L182 omatonBuilderFactory]: Interpolants [103713#(and (or (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem59.base|) (= |main_#t~mem59.base| main_~tmp~0.base)) (or (not (= |main_#t~mem59.base| main_~tmp~0.base)) (and (or (= 0 (select |#valid| 0)) (not (= main_~tmp~0.offset |main_#t~mem59.offset|))) (or (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem59.offset|) (= main_~tmp~0.offset |main_#t~mem59.offset|)))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset 0)), 103712#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0)), 103715#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.offset)) (= 0 (select |#valid| main_~tmpList~0.base))) (= main_~tmp~0.offset 0)), 103714#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (and (= 0 |main_#t~mem60.base|) (= 0 (select |#valid| 0))) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset 0)), 103717#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| main_~tmpList~0.base)) (= main_~tmp~0.offset 0) (or (not (= main_~tmp~0.offset |main_#t~mem61.offset|)) (not (= main_~tmp~0.base |main_#t~mem61.base|)))), 103716#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (not (= main_~tmp~0.offset |main_#t~mem61.offset|)) (not (= main_~tmp~0.base |main_#t~mem61.base|)) (= 0 (select |#valid| main_~tmpList~0.base))) (= main_~tmp~0.offset 0)), 103719#(= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)), 103718#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)) (= 1 (select |#valid| main_~tmpList~0.base))), 103721#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (and (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|))) (and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.offset |main_#t~mem56.offset|))))), 103720#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 103723#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| main_~tmp~0.base))), 103722#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= 0 |main_#t~mem58.base|) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| main_~tmp~0.base))), 103725#(= 1 (select |#valid| main_~tmp~0.base)), 103724#(and (or (not (= main_~tmp~0.base |main_#t~mem64.base|)) (= |main_#t~mem64.base| 0) (not (= |main_#t~mem64.offset| 0))) (= 1 (select |#valid| main_~tmp~0.base))), 103705#false, 103704#true, 103707#(and (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 103706#(= 0 (select |#valid| 0)), 103709#(and (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0)), 103708#(and (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 103711#(or |main_#t~short49| (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0))), 103710#(and (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-02-02 20:10:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:46,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:10:46,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:10:46,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:10:46,677 INFO L87 Difference]: Start difference. First operand 1103 states and 1448 transitions. Second operand 22 states. [2018-02-02 20:10:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:48,458 INFO L93 Difference]: Finished difference Result 1225 states and 1575 transitions. [2018-02-02 20:10:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:10:48,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-02-02 20:10:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:48,460 INFO L225 Difference]: With dead ends: 1225 [2018-02-02 20:10:48,460 INFO L226 Difference]: Without dead ends: 1225 [2018-02-02 20:10:48,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=647, Invalid=2215, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:10:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-02-02 20:10:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1087. [2018-02-02 20:10:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2018-02-02 20:10:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2018-02-02 20:10:48,465 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 65 [2018-02-02 20:10:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:48,465 INFO L432 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2018-02-02 20:10:48,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:10:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2018-02-02 20:10:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:10:48,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:48,466 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, 1] [2018-02-02 20:10:48,466 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848451, now seen corresponding path program 1 times [2018-02-02 20:10:48,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:48,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,050 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 20:10:49,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:49,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:10:49,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,050 INFO 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 20:10:49,050 INFO L182 omatonBuilderFactory]: Interpolants [106113#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106112#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106115#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 106114#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 106117#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tree~0.base main_~tmp~0.base)), 106116#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 106119#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 106118#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 106121#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 106120#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 106123#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 106122#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 106125#(= 1 (select |#valid| |main_#t~mem42.base|)), 106124#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 106103#false, 106102#true, 106105#(= 0 main_~tree~0.offset), 106104#(= 0 |main_#t~malloc0.offset|), 106107#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 106106#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 106109#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106108#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106111#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 106110#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset))] [2018-02-02 20:10:49,050 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 20:10:49,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:10:49,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:10:49,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:49,051 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 24 states. Received shutdown request... [2018-02-02 20:10:49,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:10:49,260 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:10:49,264 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:10:49,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:10:49 BoogieIcfgContainer [2018-02-02 20:10:49,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:10:49,265 INFO L168 Benchmark]: Toolchain (without parser) took 75054.45 ms. Allocated memory was 404.2 MB in the beginning and 1.3 GB in the end (delta: 878.2 MB). Free memory was 358.3 MB in the beginning and 1.0 GB in the end (delta: -688.9 MB). Peak memory consumption was 189.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:49,266 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:10:49,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.20 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 346.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:49,266 INFO L168 Benchmark]: Boogie Preprocessor took 33.80 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:49,266 INFO L168 Benchmark]: RCFGBuilder took 515.15 ms. Allocated memory is still 404.2 MB. Free memory was 345.1 MB in the beginning and 289.4 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:49,266 INFO L168 Benchmark]: TraceAbstraction took 74315.04 ms. Allocated memory was 404.2 MB in the beginning and 1.3 GB in the end (delta: 878.2 MB). Free memory was 289.4 MB in the beginning and 1.0 GB in the end (delta: -757.8 MB). Peak memory consumption was 120.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:49,268 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.14 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.20 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 346.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.80 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 515.15 ms. Allocated memory is still 404.2 MB. Free memory was 345.1 MB in the beginning and 289.4 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74315.04 ms. Allocated memory was 404.2 MB in the beginning and 1.3 GB in the end (delta: 878.2 MB). Free memory was 289.4 MB in the beginning and 1.0 GB in the end (delta: -757.8 MB). Peak memory consumption was 120.4 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 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1087states) and interpolant automaton (currently 11 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 220 locations, 101 error locations. TIMEOUT Result, 74.2s OverallTime, 82 OverallIterations, 3 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14295 SDtfs, 62703 SDslu, 70265 SDs, 0 SdLazy, 75098 SolverSat, 4883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1959 GetRequests, 155 SyntacticMatches, 101 SemanticMatches, 1702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17291 ImplicationChecksByTransitivity, 31.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 62/212 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 81 MinimizatonAttempts, 24972 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 3545 NumberOfCodeBlocks, 3545 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 3463 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 50 PerfectInterpolantSequences, 62/212 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/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-10-49-275.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-10-49-275.csv Completed graceful shutdown