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/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:56:50,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:56:50,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:56:50,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:56:50,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:56:50,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:56:50,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:56:50,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:56:50,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:56:50,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:56:50,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:56:50,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:56:50,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:56:50,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:56:50,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:56:50,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:56:50,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:56:50,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:56:50,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:56:50,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:56:50,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:56:50,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:56:50,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:56:50,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:56:50,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:56:50,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:56:50,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:56:50,486 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:56:50,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:56:50,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:56:50,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:56:50,487 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:56:50,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:56:50,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:56:50,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:56:50,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:56:50,498 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:56:50,498 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:56:50,499 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:56:50,500 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:56:50,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:56:50,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:56:50,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:56:50,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:56:50,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:56:50,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:56:50,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:56:50,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:56:50,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:56:50,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:56:50,538 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:56:50,541 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:56:50,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:56:50,543 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:56:50,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-02-02 20:56:50,704 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:56:50,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:56:50,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:56:50,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:56:50,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:56:50,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274f1477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50, skipping insertion in model container [2018-02-02 20:56:50,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:56:50,751 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:56:50,850 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:56:50,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:56:50,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50 WrapperNode [2018-02-02 20:56:50,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:56:50,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:56:50,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:56:50,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:56:50,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (1/1) ... [2018-02-02 20:56:50,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:56:50,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:56:50,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:56:50,914 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:56:50,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (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:56:50,951 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:56:50,951 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:56:50,951 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:56:50,951 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:56:50,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:56:51,359 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:56:51,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:56:51 BoogieIcfgContainer [2018-02-02 20:56:51,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:56:51,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:56:51,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:56:51,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:56:51,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:56:50" (1/3) ... [2018-02-02 20:56:51,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3f88e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:56:51, skipping insertion in model container [2018-02-02 20:56:51,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:56:50" (2/3) ... [2018-02-02 20:56:51,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3f88e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:56:51, skipping insertion in model container [2018-02-02 20:56:51,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:56:51" (3/3) ... [2018-02-02 20:56:51,367 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-02-02 20:56:51,374 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:56:51,385 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-02 20:56:51,419 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:56:51,419 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:56:51,420 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:56:51,420 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:56:51,420 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:56:51,420 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:56:51,420 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:56:51,420 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:56:51,421 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:56:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-02-02 20:56:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:56:51,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:51,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:51,445 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196070, now seen corresponding path program 1 times [2018-02-02 20:56:51,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:51,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:51,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:56:51,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:51,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:56:51,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:51,586 INFO L134 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:56:51,586 INFO L182 omatonBuilderFactory]: Interpolants [192#false, 193#(= 1 (select |#valid| |main_#t~malloc0.base|)), 194#(= 1 (select |#valid| main_~list~0.base)), 191#true] [2018-02-02 20:56:51,586 INFO L134 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:56:51,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:56:51,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:56:51,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:56:51,602 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 4 states. [2018-02-02 20:56:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:51,813 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-02-02 20:56:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:56:51,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:56:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:51,822 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:56:51,822 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:56:51,824 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:56:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:56:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 181. [2018-02-02 20:56:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 20:56:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2018-02-02 20:56:51,855 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 8 [2018-02-02 20:56:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:51,855 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2018-02-02 20:56:51,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:56:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2018-02-02 20:56:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:56:51,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:51,856 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:51,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196071, now seen corresponding path program 1 times [2018-02-02 20:56:51,857 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:51,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:51,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:56:51,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:51,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:56:51,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:51,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:56:51,916 INFO L182 omatonBuilderFactory]: Interpolants [593#true, 594#false, 595#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 596#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 8))] [2018-02-02 20:56:51,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:56:51,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:56:51,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:56:51,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:56:51,917 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 4 states. [2018-02-02 20:56:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:52,039 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-02-02 20:56:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:56:52,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:56:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:52,041 INFO L225 Difference]: With dead ends: 204 [2018-02-02 20:56:52,041 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 20:56:52,042 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:56:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 20:56:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2018-02-02 20:56:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:56:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-02 20:56:52,056 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 8 [2018-02-02 20:56:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:52,057 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-02 20:56:52,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:56:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-02 20:56:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:56:52,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:52,057 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:52,057 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051431, now seen corresponding path program 1 times [2018-02-02 20:56:52,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:52,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:52,133 INFO L134 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:56:52,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:52,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:56:52,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:52,134 INFO L134 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:56:52,134 INFO L182 omatonBuilderFactory]: Interpolants [996#true, 997#false, 998#(= 1 (select |#valid| |main_#t~malloc4.base|)), 999#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 1000#(= 1 (select |#valid| |main_#t~mem6.base|))] [2018-02-02 20:56:52,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:56:52,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:52,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:52,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:52,135 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-02-02 20:56:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:52,413 INFO L93 Difference]: Finished difference Result 329 states and 358 transitions. [2018-02-02 20:56:52,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:56:52,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 20:56:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:52,415 INFO L225 Difference]: With dead ends: 329 [2018-02-02 20:56:52,415 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 20:56:52,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:56:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 20:56:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 192. [2018-02-02 20:56:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:56:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-02-02 20:56:52,425 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 17 [2018-02-02 20:56:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:52,426 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-02-02 20:56:52,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-02-02 20:56:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:56:52,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:52,427 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:52,427 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051430, now seen corresponding path program 1 times [2018-02-02 20:56:52,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:52,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:56:52,497 INFO L134 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:56:52,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:52,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:56:52,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:52,498 INFO L134 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:56:52,499 INFO L182 omatonBuilderFactory]: Interpolants [1528#true, 1529#false, 1530#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 1532#(and (= |main_#t~mem6.offset| 0) (= (select |#length| |main_#t~mem6.base|) 8))] [2018-02-02 20:56:52,499 INFO L134 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:56:52,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:52,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:52,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:52,500 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 5 states. [2018-02-02 20:56:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:52,725 INFO L93 Difference]: Finished difference Result 358 states and 397 transitions. [2018-02-02 20:56:52,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:56:52,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 20:56:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:52,727 INFO L225 Difference]: With dead ends: 358 [2018-02-02 20:56:52,727 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 20:56:52,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:56:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 20:56:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 191. [2018-02-02 20:56:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:56:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-02-02 20:56:52,734 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 17 [2018-02-02 20:56:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:52,734 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-02-02 20:56:52,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-02-02 20:56:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:56:52,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:52,735 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:52,735 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722779, now seen corresponding path program 1 times [2018-02-02 20:56:52,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:52,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:52,829 INFO L134 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:56:52,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:52,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:56:52,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:52,830 INFO L134 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:56:52,830 INFO L182 omatonBuilderFactory]: Interpolants [2088#true, 2089#false, 2090#(= (select |#valid| main_~list~0.base) 1), 2091#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 2092#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2093#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base |main_#t~mem6.base|))), 2094#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 2095#(= 1 (select |#valid| |main_#t~mem8.base|))] [2018-02-02 20:56:52,830 INFO L134 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:56:52,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:56:52,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:56:52,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:56:52,831 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 8 states. [2018-02-02 20:56:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:53,208 INFO L93 Difference]: Finished difference Result 332 states and 359 transitions. [2018-02-02 20:56:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:56:53,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 20:56:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:53,210 INFO L225 Difference]: With dead ends: 332 [2018-02-02 20:56:53,210 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 20:56:53,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:56:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 20:56:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2018-02-02 20:56:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 20:56:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2018-02-02 20:56:53,216 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 20 [2018-02-02 20:56:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:53,216 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2018-02-02 20:56:53,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:56:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2018-02-02 20:56:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:56:53,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:53,217 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:53,217 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722780, now seen corresponding path program 1 times [2018-02-02 20:56:53,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:53,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:53,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:53,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:56:53,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:53,309 INFO L182 omatonBuilderFactory]: Interpolants [2628#true, 2629#false, 2630#(= (select |#valid| main_~list~0.base) 1), 2631#(and (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2632#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2633#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base |main_#t~mem6.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2634#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2635#(and (= (select |#length| |main_#t~mem8.base|) 8) (= |main_#t~mem8.offset| 0))] [2018-02-02 20:56:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:53,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:56:53,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:56:53,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:56:53,310 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 8 states. [2018-02-02 20:56:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:53,725 INFO L93 Difference]: Finished difference Result 334 states and 361 transitions. [2018-02-02 20:56:53,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:56:53,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 20:56:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:53,726 INFO L225 Difference]: With dead ends: 334 [2018-02-02 20:56:53,726 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 20:56:53,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:56:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 20:56:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 189. [2018-02-02 20:56:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 20:56:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-02-02 20:56:53,730 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 20 [2018-02-02 20:56:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:53,731 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-02-02 20:56:53,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:56:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2018-02-02 20:56:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:56:53,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:53,732 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:56:53,732 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash -778525244, now seen corresponding path program 1 times [2018-02-02 20:56:53,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:53,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:53,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:53,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:56:53,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:53,776 INFO L182 omatonBuilderFactory]: Interpolants [3169#true, 3170#false, 3171#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 3172#(and (= |main_#t~mem10.offset| 0) (= 0 |main_#t~mem10.base|)), 3173#(not |main_#t~short12|)] [2018-02-02 20:56:53,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:56:53,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:53,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:53,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:53,776 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 5 states. [2018-02-02 20:56:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:53,857 INFO L93 Difference]: Finished difference Result 282 states and 308 transitions. [2018-02-02 20:56:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:56:53,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 20:56:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:53,858 INFO L225 Difference]: With dead ends: 282 [2018-02-02 20:56:53,859 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 20:56:53,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:56:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 20:56:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 193. [2018-02-02 20:56:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:56:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-02 20:56:53,862 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 26 [2018-02-02 20:56:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:53,862 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-02 20:56:53,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-02 20:56:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:56:53,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:53,863 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] [2018-02-02 20:56:53,863 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157193, now seen corresponding path program 1 times [2018-02-02 20:56:53,864 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:53,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:53,914 INFO L134 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:56:53,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:53,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:56:53,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:53,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:56:53,915 INFO L182 omatonBuilderFactory]: Interpolants [3653#true, 3654#false, 3655#(= 1 (select |#valid| |main_#t~malloc0.base|)), 3656#(= 1 (select |#valid| main_~list~0.base)), 3657#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 20:56:53,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:56:53,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:53,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:53,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:53,915 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-02-02 20:56:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:54,035 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-02-02 20:56:54,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:56:54,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 20:56:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:54,036 INFO L225 Difference]: With dead ends: 203 [2018-02-02 20:56:54,036 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 20:56:54,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 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:56:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 20:56:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2018-02-02 20:56:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 20:56:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-02-02 20:56:54,038 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 28 [2018-02-02 20:56:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:54,039 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-02-02 20:56:54,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-02-02 20:56:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:56:54,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:54,040 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:54,040 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157194, now seen corresponding path program 1 times [2018-02-02 20:56:54,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:54,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:54,141 INFO L134 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:56:54,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:54,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:56:54,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:54,142 INFO L134 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:56:54,142 INFO L182 omatonBuilderFactory]: Interpolants [4052#true, 4053#false, 4054#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4055#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 4056#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1)), 4057#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 4058#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 20:56:54,142 INFO L134 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:56:54,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:56:54,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:56:54,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:56:54,143 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 7 states. [2018-02-02 20:56:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:54,340 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2018-02-02 20:56:54,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:56:54,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-02 20:56:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:54,342 INFO L225 Difference]: With dead ends: 242 [2018-02-02 20:56:54,342 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 20:56:54,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:56:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 20:56:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2018-02-02 20:56:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:56:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-02-02 20:56:54,345 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 28 [2018-02-02 20:56:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:54,346 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-02-02 20:56:54,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:56:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-02-02 20:56:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:56:54,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:54,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:54,347 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523681, now seen corresponding path program 1 times [2018-02-02 20:56:54,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:54,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:56:54,397 INFO L134 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:56:54,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:54,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:56:54,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:54,398 INFO L182 omatonBuilderFactory]: Interpolants [4522#true, 4523#false, 4524#(= 1 (select |#valid| |main_#t~malloc14.base|)), 4525#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4526#(= 1 (select |#valid| |main_#t~mem16.base|)), 4527#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 20:56:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:54,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:56:54,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:56:54,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:56:54,399 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 6 states. [2018-02-02 20:56:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:54,565 INFO L93 Difference]: Finished difference Result 311 states and 359 transitions. [2018-02-02 20:56:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:56:54,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 20:56:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:54,566 INFO L225 Difference]: With dead ends: 311 [2018-02-02 20:56:54,566 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 20:56:54,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:56:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 20:56:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 214. [2018-02-02 20:56:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 20:56:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2018-02-02 20:56:54,569 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 245 transitions. Word has length 31 [2018-02-02 20:56:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:54,569 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 245 transitions. [2018-02-02 20:56:54,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:56:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 245 transitions. [2018-02-02 20:56:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:56:54,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:54,570 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:54,570 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:54,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523682, now seen corresponding path program 1 times [2018-02-02 20:56:54,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:54,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:56:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:54,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:54,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:56:54,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:54,621 INFO L182 omatonBuilderFactory]: Interpolants [5060#true, 5061#false, 5062#(and (= 8 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|)), 5063#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5064#(and (= 0 |main_#t~mem16.offset|) (= 8 (select |#length| |main_#t~mem16.base|))), 5065#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 20:56:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:54,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:56:54,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:56:54,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:56:54,622 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. Second operand 6 states. [2018-02-02 20:56:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:54,822 INFO L93 Difference]: Finished difference Result 333 states and 389 transitions. [2018-02-02 20:56:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:56:54,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 20:56:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:54,823 INFO L225 Difference]: With dead ends: 333 [2018-02-02 20:56:54,824 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 20:56:54,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:56:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 20:56:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 199. [2018-02-02 20:56:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:56:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 229 transitions. [2018-02-02 20:56:54,827 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 229 transitions. Word has length 31 [2018-02-02 20:56:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:54,828 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 229 transitions. [2018-02-02 20:56:54,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:56:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2018-02-02 20:56:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:56:54,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:54,829 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] [2018-02-02 20:56:54,829 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash -706076137, now seen corresponding path program 1 times [2018-02-02 20:56:54,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:54,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:54,861 INFO L134 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:56:54,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:54,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:56:54,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:54,861 INFO L134 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:56:54,861 INFO L182 omatonBuilderFactory]: Interpolants [5609#true, 5610#false, 5611#(not (= 0 |main_#t~malloc0.base|)), 5612#(not (= 0 main_~list~0.base)), 5613#(not (= 0 main_~end~0.base))] [2018-02-02 20:56:54,861 INFO L134 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:56:54,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:54,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:54,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:54,862 INFO L87 Difference]: Start difference. First operand 199 states and 229 transitions. Second operand 5 states. [2018-02-02 20:56:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:54,932 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-02-02 20:56:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:56:54,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-02 20:56:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:54,933 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:56:54,933 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:56:54,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:56:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:56:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2018-02-02 20:56:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:56:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2018-02-02 20:56:54,937 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 36 [2018-02-02 20:56:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:54,937 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2018-02-02 20:56:54,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2018-02-02 20:56:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:56:54,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:54,939 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:56:54,939 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1650873960, now seen corresponding path program 1 times [2018-02-02 20:56:54,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:54,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:55,097 INFO L134 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:56:55,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:55,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:56:55,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:55,098 INFO L134 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:56:55,098 INFO L182 omatonBuilderFactory]: Interpolants [6048#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base)), 6039#true, 6040#false, 6041#(= 0 |main_#t~malloc0.offset|), 6042#(= 0 main_~list~0.offset), 6043#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem10.base|) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem10.offset|)), 6044#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)) |main_#t~short12|), 6045#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 6046#(and (= main_~end~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 6047#(and (= 0 |main_#t~mem29.offset|) (= 0 |main_#t~mem29.base|))] [2018-02-02 20:56:55,098 INFO L134 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:56:55,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:56:55,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:56:55,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:56:55,099 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand 10 states. [2018-02-02 20:56:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:55,453 INFO L93 Difference]: Finished difference Result 322 states and 354 transitions. [2018-02-02 20:56:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:56:55,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 20:56:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:55,455 INFO L225 Difference]: With dead ends: 322 [2018-02-02 20:56:55,462 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 20:56:55,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:56:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 20:56:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 240. [2018-02-02 20:56:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:56:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2018-02-02 20:56:55,467 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 42 [2018-02-02 20:56:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:55,467 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2018-02-02 20:56:55,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:56:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2018-02-02 20:56:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:56:55,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:55,468 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] [2018-02-02 20:56:55,469 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877026, now seen corresponding path program 1 times [2018-02-02 20:56:55,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:55,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:55,507 INFO L134 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:56:55,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:55,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:56:55,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:55,508 INFO L134 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:56:55,508 INFO L182 omatonBuilderFactory]: Interpolants [6633#true, 6634#false, 6635#(= 1 (select |#valid| |main_#t~malloc20.base|)), 6636#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))), 6637#(= 1 (select |#valid| |main_#t~mem22.base|))] [2018-02-02 20:56:55,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:56:55,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:55,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:55,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:55,509 INFO L87 Difference]: Start difference. First operand 240 states and 272 transitions. Second operand 5 states. [2018-02-02 20:56:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:55,677 INFO L93 Difference]: Finished difference Result 359 states and 410 transitions. [2018-02-02 20:56:55,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:56:55,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-02 20:56:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:55,678 INFO L225 Difference]: With dead ends: 359 [2018-02-02 20:56:55,678 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 20:56:55,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:56:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 20:56:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 239. [2018-02-02 20:56:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 20:56:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 271 transitions. [2018-02-02 20:56:55,682 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 271 transitions. Word has length 43 [2018-02-02 20:56:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:55,682 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 271 transitions. [2018-02-02 20:56:55,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 271 transitions. [2018-02-02 20:56:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:56:55,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:55,683 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] [2018-02-02 20:56:55,683 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877025, now seen corresponding path program 1 times [2018-02-02 20:56:55,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:55,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:55,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:56:55,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:55,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:56:55,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:55,727 INFO L182 omatonBuilderFactory]: Interpolants [7242#true, 7243#false, 7244#(and (= 8 (select |#length| |main_#t~malloc20.base|)) (= 0 |main_#t~malloc20.offset|)), 7245#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 7246#(and (= |main_#t~mem22.offset| 0) (= (select |#length| |main_#t~mem22.base|) 8))] [2018-02-02 20:56:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:55,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:55,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:55,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:55,727 INFO L87 Difference]: Start difference. First operand 239 states and 271 transitions. Second operand 5 states. [2018-02-02 20:56:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:55,881 INFO L93 Difference]: Finished difference Result 391 states and 449 transitions. [2018-02-02 20:56:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:56:55,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-02 20:56:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:55,882 INFO L225 Difference]: With dead ends: 391 [2018-02-02 20:56:55,882 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 20:56:55,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:56:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 20:56:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 238. [2018-02-02 20:56:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 20:56:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2018-02-02 20:56:55,886 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 43 [2018-02-02 20:56:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:55,886 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2018-02-02 20:56:55,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2018-02-02 20:56:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:56:55,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:55,887 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:55,887 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1934711090, now seen corresponding path program 1 times [2018-02-02 20:56:55,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:55,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:55,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:55,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:56:55,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:55,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:56:55,986 INFO L182 omatonBuilderFactory]: Interpolants [7882#true, 7883#false, 7884#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset))), 7885#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7886#(and (= 0 |main_#t~mem34.base|) (= 0 |main_#t~mem34.offset|)), 7887#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 20:56:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:55,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:56:55,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:56:55,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:56:55,986 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand 6 states. [2018-02-02 20:56:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:56,133 INFO L93 Difference]: Finished difference Result 323 states and 360 transitions. [2018-02-02 20:56:56,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:56:56,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 20:56:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:56,135 INFO L225 Difference]: With dead ends: 323 [2018-02-02 20:56:56,135 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 20:56:56,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:56:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 20:56:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 285. [2018-02-02 20:56:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 20:56:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 329 transitions. [2018-02-02 20:56:56,139 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 329 transitions. Word has length 44 [2018-02-02 20:56:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:56,140 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 329 transitions. [2018-02-02 20:56:56,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:56:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2018-02-02 20:56:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:56:56,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:56,141 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] [2018-02-02 20:56:56,141 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979189, now seen corresponding path program 1 times [2018-02-02 20:56:56,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:56,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:56,209 INFO L134 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:56:56,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:56,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:56:56,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:56,210 INFO L134 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:56:56,210 INFO L182 omatonBuilderFactory]: Interpolants [8502#true, 8503#false, 8504#(= (select |#valid| main_~end~0.base) 1), 8505#(and (= 1 (select |#valid| |main_#t~malloc20.base|)) (not (= main_~end~0.base |main_#t~malloc20.base|))), 8506#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))), 8507#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (not (= main_~end~0.base |main_#t~mem22.base|))), 8508#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))), 8509#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 20:56:56,211 INFO L134 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:56:56,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:56:56,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:56:56,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:56:56,211 INFO L87 Difference]: Start difference. First operand 285 states and 329 transitions. Second operand 8 states. [2018-02-02 20:56:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:56,457 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-02-02 20:56:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:56:56,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 20:56:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:56,458 INFO L225 Difference]: With dead ends: 302 [2018-02-02 20:56:56,458 INFO L226 Difference]: Without dead ends: 302 [2018-02-02 20:56:56,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:56:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-02 20:56:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2018-02-02 20:56:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:56:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-02-02 20:56:56,463 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 46 [2018-02-02 20:56:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:56,463 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-02-02 20:56:56,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:56:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-02-02 20:56:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:56:56,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:56,464 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] [2018-02-02 20:56:56,464 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979188, now seen corresponding path program 1 times [2018-02-02 20:56:56,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:56,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:56,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:56:56,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:56,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:56:56,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:56,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:56:56,564 INFO L182 omatonBuilderFactory]: Interpolants [9107#true, 9108#false, 9109#(= (select |#valid| main_~end~0.base) 1), 9110#(and (= 8 (select |#length| |main_#t~malloc20.base|)) (= 0 |main_#t~malloc20.offset|) (not (= main_~end~0.base |main_#t~malloc20.base|))), 9111#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 9112#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (not (= main_~end~0.base |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 9113#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 9114#(and (= (select |#length| |main_#t~mem24.base|) 8) (= |main_#t~mem24.offset| 0))] [2018-02-02 20:56:56,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:56:56,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:56:56,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:56:56,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:56:56,565 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 8 states. [2018-02-02 20:56:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:56,824 INFO L93 Difference]: Finished difference Result 301 states and 347 transitions. [2018-02-02 20:56:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:56:56,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 20:56:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:56,825 INFO L225 Difference]: With dead ends: 301 [2018-02-02 20:56:56,825 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 20:56:56,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:56:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 20:56:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2018-02-02 20:56:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 20:56:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 327 transitions. [2018-02-02 20:56:56,829 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 327 transitions. Word has length 46 [2018-02-02 20:56:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:56,829 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 327 transitions. [2018-02-02 20:56:56,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:56:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 327 transitions. [2018-02-02 20:56:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:56:56,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:56,830 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] [2018-02-02 20:56:56,830 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -944056626, now seen corresponding path program 1 times [2018-02-02 20:56:56,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:56,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:56,919 INFO L134 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:56:56,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:56,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:56:56,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:56,920 INFO L134 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:56:56,920 INFO L182 omatonBuilderFactory]: Interpolants [9712#(= (select |#valid| main_~list~0.base) 1), 9713#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 9714#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 9715#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base |main_#t~mem6.base|))), 9716#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 9717#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 9718#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))), 9719#(= 1 (select |#valid| |main_#t~mem29.base|)), 9720#(= 1 (select |#valid| main_~inner~0.base)), 9710#true, 9711#false] [2018-02-02 20:56:56,920 INFO L134 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:56:56,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:56:56,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:56:56,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:56:56,921 INFO L87 Difference]: Start difference. First operand 283 states and 327 transitions. Second operand 11 states. [2018-02-02 20:56:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:57,307 INFO L93 Difference]: Finished difference Result 543 states and 601 transitions. [2018-02-02 20:56:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:56:57,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 20:56:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:57,310 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:56:57,310 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 20:56:57,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 20:56:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 289. [2018-02-02 20:56:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 20:56:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2018-02-02 20:56:57,317 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 47 [2018-02-02 20:56:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:57,317 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2018-02-02 20:56:57,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:56:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2018-02-02 20:56:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:56:57,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:57,318 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] [2018-02-02 20:56:57,318 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash -944056625, now seen corresponding path program 1 times [2018-02-02 20:56:57,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:57,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:57,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:57,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:56:57,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:57,453 INFO L182 omatonBuilderFactory]: Interpolants [10577#true, 10578#false, 10579#(= (select |#valid| main_~list~0.base) 1), 10580#(and (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 10581#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 10582#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base |main_#t~mem6.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 10583#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem8.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) (+ |main_#t~mem8.offset| 4) 0)) main_~list~0.base) (+ main_~list~0.offset 4)))), 10584#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 10585#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 10586#(and (= 8 (select |#length| |main_#t~mem29.base|)) (= 0 |main_#t~mem29.offset|)), 10587#(and (= (select |#length| main_~inner~0.base) 8) (= main_~inner~0.offset 0))] [2018-02-02 20:56:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:57,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:56:57,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:56:57,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:56:57,454 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand 11 states. [2018-02-02 20:56:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:57,983 INFO L93 Difference]: Finished difference Result 596 states and 655 transitions. [2018-02-02 20:56:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:56:57,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 20:56:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:57,985 INFO L225 Difference]: With dead ends: 596 [2018-02-02 20:56:57,985 INFO L226 Difference]: Without dead ends: 596 [2018-02-02 20:56:57,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:56:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-02-02 20:56:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 296. [2018-02-02 20:56:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 20:56:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2018-02-02 20:56:57,989 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 47 [2018-02-02 20:56:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:57,989 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2018-02-02 20:56:57,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:56:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2018-02-02 20:56:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:56:57,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:57,989 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:56:57,989 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1546550031, now seen corresponding path program 1 times [2018-02-02 20:56:57,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:57,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:56:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:56:58,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:56:58,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:56:58,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:58,045 INFO L134 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:56:58,045 INFO L182 omatonBuilderFactory]: Interpolants [11504#true, 11505#false, 11506#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))), 11507#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) |main_#t~short12|), 11508#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 11509#(and (= 0 |main_#t~mem35.offset|) (= 0 |main_#t~mem35.base|)), 11510#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 20:56:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:56:58,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:56:58,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:56:58,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:56:58,046 INFO L87 Difference]: Start difference. First operand 296 states and 338 transitions. Second operand 7 states. [2018-02-02 20:56:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:58,144 INFO L93 Difference]: Finished difference Result 312 states and 354 transitions. [2018-02-02 20:56:58,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:56:58,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-02-02 20:56:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:58,145 INFO L225 Difference]: With dead ends: 312 [2018-02-02 20:56:58,145 INFO L226 Difference]: Without dead ends: 312 [2018-02-02 20:56:58,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:56:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-02-02 20:56:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-02-02 20:56:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-02 20:56:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 350 transitions. [2018-02-02 20:56:58,149 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 350 transitions. Word has length 53 [2018-02-02 20:56:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:58,149 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 350 transitions. [2018-02-02 20:56:58,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:56:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 350 transitions. [2018-02-02 20:56:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:56:58,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:58,150 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] [2018-02-02 20:56:58,150 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1009176340, now seen corresponding path program 1 times [2018-02-02 20:56:58,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:58,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:58,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:58,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:56:58,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:58,239 INFO L134 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:56:58,239 INFO L182 omatonBuilderFactory]: Interpolants [12144#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 12145#(and (= 0 |main_#t~mem38.base|) (= 0 |main_#t~mem38.offset|)), 12146#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset)), 12147#(and (= 0 main_~list~0.offset) (= 0 main_~list~0.base)), 12139#true, 12140#false, 12141#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base)), 12142#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem34.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem34.offset|)), 12143#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))] [2018-02-02 20:56:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:56:58,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:56:58,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:56:58,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:56:58,240 INFO L87 Difference]: Start difference. First operand 308 states and 350 transitions. Second operand 9 states. [2018-02-02 20:56:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:58,516 INFO L93 Difference]: Finished difference Result 392 states and 427 transitions. [2018-02-02 20:56:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:56:58,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-02-02 20:56:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:58,519 INFO L225 Difference]: With dead ends: 392 [2018-02-02 20:56:58,519 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 20:56:58,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:56:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 20:56:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 336. [2018-02-02 20:56:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 20:56:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 385 transitions. [2018-02-02 20:56:58,524 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 385 transitions. Word has length 55 [2018-02-02 20:56:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:58,524 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 385 transitions. [2018-02-02 20:56:58,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:56:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 385 transitions. [2018-02-02 20:56:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:56:58,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:58,525 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] [2018-02-02 20:56:58,525 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1219696535, now seen corresponding path program 1 times [2018-02-02 20:56:58,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:56:58,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:56:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:56:58,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:56:58,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:56:58,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:56:58,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:56:58,593 INFO L182 omatonBuilderFactory]: Interpolants [12889#true, 12890#false, 12891#(= |#valid| |old(#valid)|), 12892#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 12893#(and (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|))] [2018-02-02 20:56:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:56:58,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:56:58,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:56:58,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:56:58,594 INFO L87 Difference]: Start difference. First operand 336 states and 385 transitions. Second operand 5 states. [2018-02-02 20:56:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:56:58,755 INFO L93 Difference]: Finished difference Result 375 states and 424 transitions. [2018-02-02 20:56:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:56:58,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-02-02 20:56:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:56:58,757 INFO L225 Difference]: With dead ends: 375 [2018-02-02 20:56:58,757 INFO L226 Difference]: Without dead ends: 345 [2018-02-02 20:56:58,757 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:56:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-02-02 20:56:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2018-02-02 20:56:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-02 20:56:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 393 transitions. [2018-02-02 20:56:58,762 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 393 transitions. Word has length 56 [2018-02-02 20:56:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:56:58,762 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 393 transitions. [2018-02-02 20:56:58,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:56:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 393 transitions. [2018-02-02 20:56:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:56:58,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:56:58,763 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, 1, 1, 1, 1] [2018-02-02 20:56:58,763 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:56:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1674520475, now seen corresponding path program 1 times [2018-02-02 20:56:58,764 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:56:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:56:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:56:58,810 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 20:56:58,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:56:58 BoogieIcfgContainer [2018-02-02 20:56:58,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:56:58,844 INFO L168 Benchmark]: Toolchain (without parser) took 8140.25 ms. Allocated memory was 399.0 MB in the beginning and 768.1 MB in the end (delta: 369.1 MB). Free memory was 355.9 MB in the beginning and 639.4 MB in the end (delta: -283.6 MB). Peak memory consumption was 85.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:58,845 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:56:58,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.04 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 344.0 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:56:58,846 INFO L168 Benchmark]: Boogie Preprocessor took 31.96 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 341.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:58,846 INFO L168 Benchmark]: RCFGBuilder took 446.03 ms. Allocated memory is still 399.0 MB. Free memory was 341.3 MB in the beginning and 295.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:58,846 INFO L168 Benchmark]: TraceAbstraction took 7483.45 ms. Allocated memory was 399.0 MB in the beginning and 768.1 MB in the end (delta: 369.1 MB). Free memory was 295.5 MB in the beginning and 639.4 MB in the end (delta: -344.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:56:58,848 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.04 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 344.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.96 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 341.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 446.03 ms. Allocated memory is still 399.0 MB. Free memory was 341.3 MB in the beginning and 295.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7483.45 ms. Allocated memory was 399.0 MB in the beginning and 768.1 MB in the end (delta: 369.1 MB). Free memory was 295.5 MB in the beginning and 639.4 MB in the end (delta: -344.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={10:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={10:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={10:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={10:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={10:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={10:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 188 locations, 65 error locations. UNSAFE Result, 7.4s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3778 SDtfs, 6751 SDslu, 11125 SDs, 0 SdLazy, 7817 SolverSat, 360 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 6/14 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 2064 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 849 NumberOfCodeBlocks, 849 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 769 ConstructedInterpolants, 0 QuantifiedInterpolants, 222567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 6/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-56-58-854.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-56-58-854.csv Received shutdown request...